53. Maximum Subarray
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
Explanation: [...
原创
2018-05-31 16:08:13 ·
155 阅读 ·
0 评论