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

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