最大子序和

题源：leetcode

链接：https://leetcode-cn.com/problems/maximum-subarray/solution/zui-da-zi-xu-he-by-leetcode-solution/

 

 

 

一道简单的动态规划题

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int size = nums.size();
        int temp =nums[0];
        int pre = 0;

        if(size == 1) return nums[0];

        for(int i = 0; i<size; i++){
            pre = max(pre+nums[i],nums[i]);
            temp = max(temp,pre);
        }
        return temp;
    }
};

本题还有分治法的解，后面学到了再进行添加