Maximum Subarray

题目来源Leetcode

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.

这道题采用的是动态规划的思路，具体代码如下：

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