id53. Maximum Subarray Add to List
Description Submission Solutions
Total Accepted: 169989
Total Submissions: 436088
Difficulty: Easy
Contributors: Admin
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] has the largest sum = 6.
第一种，穷举法
第二种，优化
第三种，贪婪算法