LeetCode Maximum subarray,最大子串问题
题目:
Find the contiguoussubarray within an array (containing at least one number) which has the largestsum.
For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] ha
原创
2017-07-20 13:54:26 ·
301 阅读 ·
0 评论