yxing555-CSDN博客

原创 LeetCode | 53. Maximum Subarray | Easy | DP

Question Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example Input: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 E...

2019-06-21 14:01:21 164

原创 LeetCode | 35. Search Insert Position | Easy

Question 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...

2019-06-20 14:53:18 120

原创 LeetCode | 283. Move Zeroes | Easy

Questions Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements. You must do this in-place without making a copy of the ...

2019-06-20 13:58:00 103

原创 LeetCode | 27. Remove Element | Easy

Question Given an array nums and a value val, 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 by modifying the i...

2019-06-20 11:46:12 104