class Solution {
public:
int maxSubArray(vector<int>& nums) {
int result=INT_MIN;
int count=0;
for(int i=0;i<nums.size();i++){
count+=nums[i];
if(count>result){
result=count;
}
if(count<=0){
count=0;
}
}
return result;
}
};
leetcode 最大子数组和
最新推荐文章于 2025-02-11 23:45:54 发布