原题链接:https://leetcode-cn.com/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/
int maxSubArray(vector<int>& nums) {
int n = nums.size();
int res = nums[0];
for (int i = 1; i < n; i++) {
nums[i] += max(nums[i - 1], 0);
res = max(res, nums[i]);
}
return res;
}