【leetcode】53-MaximumSubarray

problem

MaximumSubarray

code

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int max = INT_MIN;
        int sum = 0;
        for(size_t i=0; i<nums.size(); i++)
        {
            sum = nums[i];
            if(sum>max) max = sum;//err.
            for(size_t j=i+1; j<nums.size(); j++)
            {
                sum += nums[j];
                if(sum>max) max = sum;
            }
        }
        return max;
    }
};

 

 

参考

１．

https://leetcode.com/problems/maximum-subarray/description/

完