// 贪心法
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int maxnum, sum;
int i, flag = 1;
for(i = 0; i < size(nums); i++){
if(i == 0) maxnum = nums[0];
if(flag == 1) {
sum = nums[i];
if(nums[i] >= 0){
flag = 0;
}
else flag = 1;
}
else if(flag == 0){
sum += nums[i];
if(sum >= 0){
flag = 0;
}
else flag = 1;
}
if(maxnum < sum)
maxnum = sum;
}
return maxnum;
}
};
leetcode 53. 最大子序和
最新推荐文章于 2024-10-01 05:04:32 发布