class Solution {
public:
int maxSales(vector<int>& sales) {
int sum = 0;
int target = sales[0];
int i = 0;
int j = sales.size();
while(i < j)
{
sum+=sales[i];
target = max(target,sum);
if(sum < 0)
{
sum = 0;
}
i++;
}
return target;
}
};
leetcode每日一题第六十五天
最新推荐文章于 2024-09-21 10:02:17 发布