// 贪心思路
class Solution {
public int maxProfit(int[] prices, int fee) {
int buy = prices[0] + fee;
int sum = 0;
for (int p : prices) {
if (p + fee < buy) {
buy = p + fee;
} else if (p > buy){
sum += p - buy;
//保留状态buy = p,而不是buy = p + fee,因为有可能在p这个点并没有卖出,不产生交易,如果后面出现更低点,则取代p,p算真正意义上卖出。
buy = p;
}
}
return sum;
}
}
我没做出来,绝了