Leetcode53.最大子数组和

动态规划的思路做的

换了几种方式降低复杂度，但是没啥用🤣

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int n = nums.size();
        vector<int> dp(n);
        dp[0] = nums[0];
        int result = dp[0];
        for(int i=1;i<n;++i){
            dp[i] = max(dp[i-1]+nums[i],nums[i]);
            if(dp[i]>result) result = dp[i];
            //cout<<dp[i]<<",";
        }
        return result;//*max_element(dp.begin(),dp.end()); 
    }
};