發(fā)簡(jiǎn)信
IP屬地：弗吉尼亞州
-
++j 與 j++的積累
有一個(gè)vector & nums; int i = 1； int j = 0流椒； nums[ j++] = nums[ i ]; 表示將nums[...
-
53. Maximum Subarray
Find the contiguous subarray within an array (containing at least one nu...
-
39. Combination SumGiven asetof candidate numbers (C)(without duplicates)and a target numbe...
-
17. Letter Combinations of a Phone NumberGiven a digit string, return all possible letter combinations that the n...
-
22. Generate ParenthesesGivennpairs of parentheses, write a function to generate all combination...
-
28. Implement strStr()題目如下： ImplementstrStr(). Return the index of the first occurrence of nee...
-
26. Remove Duplicates from Sorted Array題目如下： Given a sorted array, remove the duplicatesin-placesuch that each ...
-
11-container with most water題目： Givennnon-negative integersa1,a2, ...,an, where each represents a po...
-
3. Longest Substring Without Repeating Characters題目如下： Given a string, find the length of thelongest substringwithout rep...