leetcode:53. Maximum Subarray

53. Maximum Subarray

又是放弃治疗，

直接学习大佬的写法吧。

 

 

lucastan

1150

Last Edit: September 30, 2018 11:11 AM

42.2K VIEWS

Idea is very simple. Basically, keep adding each integer to the sequence until the sum drops below 0.
If sum is negative, then should reset the sequence.

 

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
      int ans=nums[0],i,j,sum=0;
        for(i=0;i<nums.size();i++){
            sum+=nums[i];
            ans=max(sum,ans);//save largest ans
            sum=max(sum,0);//reste to 0 if negative
        }
        return ans;   
    }
};

 

 

 

最大连续子序列和：动态规划经典题目(2)

阅读数 1万+

 

最大连续子序列和：递归和动态规划

阅读数 1万+