class Solution {
public:
int maxProfit(vector<int>& prices, int fee) {
int ans = 0, flag = 0, a = prices[0] + fee,start = a;
for (int i = 1; i < prices.size(); i++) {
if (prices[i] + fee < a)
a = prices[i] + fee;
else if (prices[i] > a) {
ans += prices[i] - a;
a = prices[i];
}
}
return ans;
}
};
LeetCode 122. 买卖股票的最佳时机 II
最新推荐文章于 2024-09-14 15:41:03 发布