Leetcodes Solutions 53 Maximum Subarray

05-16

匯總

雪之下雪乃：leetcode解題總匯?

zhuanlan.zhihu.com

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.

思路1

當sum小於0，則重置為0

相當數組從這裡重新開始計和

class Solution{public: int maxSubArray(vector<int>& nums){ int n = nums.size(); int ans = nums[0], i, j, sum = 0; for(i = 0; i < n; i++){ sum += nums[i]; ans = max(sum, ans); sum = max(sum, 0); } return ans; }};