class Solution {
public:
int maxSubArray(vector<int>& 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;
}
};
最大子数组和
最新推荐文章于 2024-10-01 05:04:32 发布