leetcode 053 —— Maximum Subarray

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.

思路：贪心算法，如果当前sum+num[i]<0,重置sum为0

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