LeetCode714.买卖股票的最佳时机含手续费

class Solution {
public:
    int maxProfit(vector<int>& prices, int fee) {
        if (prices.size() == 1)
            return 0;
        vector<vector<int>> dp(prices.size(), vector<int>(2));
        dp[0][0] = 0;
        dp[0][1] = - prices[0];
        int maxProfit = 0;
        for (int i = 1; i < prices.size(); i++) {
            dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] - prices[i]);
            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i] - fee);
            int tempMax = max(dp[i][1], dp[i][0]);
            maxProfit = max(maxProfit, tempMax);
        }
        return maxProfit;
    }
};