//53
class Solution {
public:
int maxSubArray(vector<int>& s) {
if (s.empty()) return 0;
int sum = 0;
int ans = s[0];
for (int i = 0; i < s.size(); i++) {
sum += s[i];
ans = max(ans, sum);
if (sum < 0) sum = 0;
}
return ans;
}
};
LeetCode53. 最大子序和
最新推荐文章于 2024-07-19 19:25:43 发布