该篇文章讨论了解题网站LeetCode上的股票买卖问题，涉及在考虑交易费用的情况下，如何通过贪婪算法求得最大利润。算法核心是计算买入价buy和卖出价sell，每次更新时，买入价等于当天价格和当前最大卖出价之差，卖出价等于买入价加上当天价格再减去交易费。
LeetCode 714. Best Time to Buy and Sell Stock with Transaction Fee
| 考点 | 难度 |
|---|---|
| Greedy | Easy |
题目
You are given an array prices where prices[i] is the price of a given stock on the ith day, and an integer fee representing a transaction fee.
Find the maximum profit you can achieve. You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction.
思路
buy = max(buy, sell - price)
sell = max(sell, buy + price - fee)
iterate一遍，sell是max profit
答案
class Solution(object):
def maxProfit(self, prices, fee):
buy = float('-inf')
sell = 0
for price in prices:
buy = max(buy, sell - price)
sell = max(sell, buy + price - fee)
89
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
