714. Best Time to Buy and Sell Stock with Transaction Fee

本题出处

题目描述：

Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee representing a transaction fee.
You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction. You may not buy more than 1 share of a stock at a time (ie. you must sell the stock share before you buy again.)
Return the maximum profit you can make.

Example 1:

Input: prices = [1, 3, 2, 8, 4, 9], fee = 2
Output: 8
Explanation: The maximum profit can be achieved by:

• Buyling at prices[0] = 1
• Selling at prices[3] = 8
• Buying at prices[4] = 4
• Selling at prices[5] = 9

Note:

• 0 < prices.length <= 50000.
• 0 < prices[i] < 50000.
• 0 <= fee < 50000.

题目大意：
是一道买卖股票但有手续费的问题。你不能同时买入多支股票，这意味着在卖之前你必须先有买入有且仅有一只股票。每次买卖股票（买入并且卖出）需要支付一定的手续费fee。你可以买卖无限多次，求能挣最多的钱。
这也是一道动态规划的问题。考虑某一状态，由于上一个状态可能有两种情况（继续持有，或者选择卖出），那么此状态也可能有两种情况（继续观望不买入，后者选择买入）。有些同学可能会困惑，为什么卖出买入不会同时发生在一天（同个状态）。因为有手续费的原因，所以如果同一天卖出又买入，一定是亏本的。

所以，算法如下

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