- 博客(8)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 LeetCode-66 Plus One
Description Given a non-empty array of digits representing a non-negative integer, increment one to the integer. The digits are stored such that the most significant digit is at the head of the list, and each element in the array contains a single digit. Y
2020-08-28 21:31:05
98
原创 LeetCode-65 Valid Number
Description Validate if a given string can be interpreted as a decimal number. Note: It is intended for the problem statement to be ambiguous. You should gather all requirements up front before implementing one. However, here is a list of characters that c
2020-08-25 20:59:04
111
原创 LeetCode-64 Minimum Path Sum
Description Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down or right at any point in time. Example Input: [ [1,3,1], [
2020-08-21 21:20:07
95
原创 LeetCode-63 Unique Paths II
Description A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below). The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked ‘Finish
2020-08-18 21:35:00
99
原创 LeetCode-62 Unique Paths
Description A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below). The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked ‘Finish
2020-08-14 22:01:41
108
原创 LeetCode-61 Rotate List
Description Given a linked list, rotate the list to the right by k places, where k is non-negative. Example Example 1: Input: 1->2->3->4->5->NULL, k = 2 Output: 4->5->1->2->3->NULL Explanation: rotate 1 steps to the right: 5-&
2020-08-11 20:54:02
119
原创 LeetCode-60 Permutation Sequence
Description The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, we get the following sequence for n = 3: “123” “132” “213” “231” “312” “321” Given n and k, return the kth permutation seq
2020-08-07 23:16:39
127
原创 LeetCode-59 Spiral Matrix II
Description Given a positive integer n, generate a square matrix filled with elements from 1 to n2 in spiral order. Example Input: 3 Output: [ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6, 5 ] ] Submissions 这道题是54题的改进版，因此采用相同的解题思路，可回顾https://blog.csdn.net/weixin_41875
2020-08-04 21:31:58
103
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人