Leetcode53[easy]--Maximum Subarray

难度：easy 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

>>阅读原文<<