码迷,mamicode.com
首页 >  
搜索关键字:given a n n matrix    ( 24496个结果
48. 旋转图像 + 数组遍历 + 思维
48. 旋转图像 LeetCode_48 题目描述 方法一:使用辅助数组 class Solution { public void rotate(int[][] matrix) { //第i,j的元素翻转后出现在倒数第i列的第j个元素 int m = matrix.length; int n = m ...
分类:编程语言   时间:2021-03-30 13:19:14    阅读次数:0
0423. Reconstruct Original Digits from English (M)
Reconstruct Original Digits from English (M) 题目 Given a non-empty string containing an out-of-order English representation of digits 0-9, output the d ...
分类:其他好文   时间:2021-03-30 13:01:57    阅读次数:0
[LeetCode] 1089. Duplicate Zeros 复写零
Given a fixed length array arr of integers, duplicate each occurrence of zero, shifting the remaining elements to the right. Note that elements beyond ...
分类:其他好文   时间:2021-03-30 12:46:57    阅读次数:0
Leetcode 111. Minimum Depth of Binary Tree
Description:Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to t ...
分类:其他好文   时间:2021-03-18 14:37:13    阅读次数:0
[LeetCode] 670. Maximum Swap
Given a non-negative integer, you could swap two digits at most once to get the maximum valued number. Return the maximum valued number you could get. ...
分类:其他好文   时间:2021-03-18 14:32:17    阅读次数:0
【数据结构】算法 Remove Duplicates from Sorted List 2 删除排序链表中的重复元素
Remove Duplicates from Sorted List 2 删除排序链表中的重复元素 Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only d ...
分类:编程语言   时间:2021-03-17 15:07:16    阅读次数:0
LeetCode 54. 螺旋矩阵
54. 螺旋矩阵 Difficulty: 中等 给你一个 m 行 n 列的矩阵 matrix ,请按照 顺时针螺旋顺序 ,返回矩阵中的所有元素。 示例 1: 输入:matrix = [[1,2,3],[4,5,6],[7,8,9]] 输出:[1,2,3,6,9,8,7,4,5] 示例 2: 输入:m ...
分类:其他好文   时间:2021-03-17 14:59:57    阅读次数:0
【python】Leetcode每日一题-螺旋矩阵2
【python】Leetcode每日一题-螺旋矩阵2 【题目描述】 给你一个正整数 n ,生成一个包含 1 到 n2 所有元素,且元素按顺时针顺序螺旋排列的 n x n 正方形矩阵 matrix 。 示例1: 输入:n = 3 输出:[[1,2,3],[8,9,4],[7,6,5]] 示例2: 输入 ...
分类:编程语言   时间:2021-03-17 14:59:30    阅读次数:0
0823. Binary Trees With Factors (M)
Binary Trees With Factors (M) 题目 Given an array of unique integers, arr, where each integer arr[i] is strictly greater than 1. We make a binary tree u ...
分类:其他好文   时间:2021-03-15 11:24:45    阅读次数:0
Leetcode 107. Binary Tree Level Order Traversal II
Description: Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by lev ...
分类:其他好文   时间:2021-03-15 11:13:18    阅读次数:0
24496条   上一页 1 ... 5 6 7 8 9 ... 2450 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!