leetcode
happy_bigqiang
这个作者很懒,什么都没留下…
展开
-
[leetcode]--1. Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the same ele原创 2017-08-18 14:24:46 · 205 阅读 · 0 评论 -
[leetcode]--26. Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with cons原创 2017-08-20 09:06:12 · 193 阅读 · 0 评论 -
[leedcode]-- 27. Remove Element
[leedcode]– Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant me原创 2017-08-20 11:05:02 · 233 阅读 · 0 评论 -
[leedcode]–35. Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.Here原创 2017-08-20 16:32:54 · 218 阅读 · 0 评论 -
[leedcode]--53. Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] has the原创 2017-08-22 15:14:40 · 229 阅读 · 0 评论