240 发简信
IP属地:弗吉尼亚州
  • ++j 与 j++的积累

    有一个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...

  • Resize,w 360,h 240
    39. Combination Sum

    Given asetof candidate numbers (C)(without duplicates)and a target numbe...

  • Resize,w 360,h 240
    17. Letter Combinations of a Phone Number

    Given a digit string, return all possible letter combinations that the n...

  • Resize,w 360,h 240
    22. Generate Parentheses

    Givennpairs of parentheses, write a function to generate all combination...

  • Resize,w 360,h 240
    28. Implement strStr()

    题目如下: ImplementstrStr(). Return the index of the first occurrence of nee...

  • Resize,w 360,h 240
    26. Remove Duplicates from Sorted Array

    题目如下: Given a sorted array, remove the duplicatesin-placesuch that each ...

  • Resize,w 360,h 240
    11-container with most water

    题目: Givennnon-negative integersa1,a2, ...,an, where each represents a po...

  • Resize,w 360,h 240
    3. Longest Substring Without Repeating Characters

    题目如下: Given a string, find the length of thelongest substringwithout rep...