[leetcode]53. Maximum Subarray
Description:
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...
原创
2019-09-01 15:36:53 ·
73 阅读 ·
0 评论