53. Maximum Subarray

problem:

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.

很自然的能想到穷举法，遍历数组，计算所有子字符串的和，取最大的那一个。但这样时间复杂度较大。

Kadane算法又被称为扫描法，该算法用到了一个启发式规则：如果前面一段连续子数组的和小于0，那么就丢弃它。

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