53.最大子序和
https://leetcode-cn.com/problems/maximum-subarray/
这题的思路也不错,可以记一下
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int sum=0;
int ans = nums[0];
for(int i=0;i<nums.size();i++){
if(sum>=0){
sum = sum+nums[i];
}
else{
sum = nums[i];
}
ans = max(sum,ans);
}
return ans;
}
};