53. 最大子数组和 - 力扣(LeetCode) (leetcode-cn.com)
class Solution {
public:
int maxSubArray(vector& nums) {
int pre = 0, max_sum = INT_MIN;
for (auto x : nums) {
pre = pre > 0 ? pre + x : x;
pre > max_sum ? max_sum = pre : NULL;
}
return max_sum;
}
};



