55. maximum sum of continuous subarrays

Topic link

Record the standard schedule of classic questions .

Ideas

Greedy practices ： Add a number first , If it is less than 0 Just directly remake. Because there's no need to put negative numbers first , It would be better to get rid of it .

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int res = -0x3f3f3f3f, sum = 0;
        for(int i = 0,tmp = 0; i < nums.size(); i++){
            sum += nums[i];
            res = max(res,sum);
            if(sum < 0) sum = 0;
            // If nums All negative numbers return the largest negative number 
        }
        return res;
    }
};

dp Strategy .