leetcode 每日一题：714. 买卖股票的最佳时机含手续费

class Solution:
    def maxProfit(self, prices: List[int], fee: int) -> int:
        """
        F[i][0] 第i天未持有股票的最大利润
        F[i][1] 第i天持有股票

        F[i][0] = max(F[i-1][0], F[i-1][1] + prices[i] - fee)
        F[i][1] = max(F[i-1][1], F[i-1][0] - prices[i])

        初始条件
        F[0][0] = 0
        F[0][1] 表示当前买了 = -price[0]

        return F[n][0]
        """
        if not prices:
            return 0
        n = len(prices)
        F = [[0,0] for i in range(n)]
        F[0][0] = 0
        F[0][1] = -prices[0]
        for i in range(1, n):
            F[i][0] = max(F[i-1][0], F[i-1][1] + prices[i] - fee)
            F[i][1] = max(F[i-1][1], F[i-1][0] - prices[i])
        return F[n-1][0]