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

class Solution 
{
public:
    int maxProfit(vector& prices, int fee) 
    {
		vector> dp(prices.size(), vector(2, 0));

		if (prices.size()<1)
		{
			return 0;
		}

		dp[0][0] = -prices[0];
		for (int i = 1; i < prices.size(); ++i)
		{
			dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] - prices[i]);//前一天就买入，保持买入状态；卖出后又买入
			dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] + prices[i] - fee);//前一天就卖出，保持卖出状态；买入后又卖出
		}

		return max(dp[prices.size() - 1][0], dp[prices.size() - 1][1]);
    }
};

参考：
https://programmercarl.com/0714.%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%E5%90%AB%E6%89%8B%E7%BB%AD%E8%B4%B9%EF%BC%88%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%EF%BC%89.html