53. 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 len = nums.size();
        if (len == 0)
            return 0;
        vector<int> vet;
        if (len == 1)
            return nums[0];
        vet.push_back(nums[0]);
        vet.push_back(max(nums[0] + nums[1], nums[1]));
        for (int i = 2; i < len; i++)
        {
            vet.push_back( max(vet[i - 1] + nums[i], nums[i]));
        }
        sort(vet.begin(), vet.end());
        return vet.back();
    }
};