class Solution {
public:
int maxSubArray(vector<int>& nums) {
int pre = 0;
int maxAns = nums[0];
for(int i = 0; i < nums.size(); i++)
{
pre = max(pre + nums[i], nums[i]);
maxAns = max(maxAns, pre);
}
return maxAns;
}
};
参考链接:https://leetcode-cn.com/problems/maximum-subarray/solution/zui-da-zi-xu-he-by-leetcode-solution/