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

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