[Leetcode]53. 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.

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