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

Question:

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:

Buying at prices[0] = 1
Selling at prices[3] = 8
Buying at prices[4] = 4
Selling at prices[5] = 9
The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8.

Note:

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

Solution:

看了discuss才恍然大悟，这道题和House Robber那道题并不一样。

这道题只需要简单的考虑前一天是否拥有股票，hold[i-1]为拥有，sell[i-1]为没拥有，即前一天卖出去了。

那么就有状态转移方程，

sell[i] = max(sell[i-1], hold[i-1] + prices[i])
hold[i] = max(hold[i-1], sell[i-1] - preces[i] - fee)

注意一次交易只需要一次fee，可以放在hold或者sell上，但不要同时减去它。一开始想复杂了，想到了前一天的sell和hold可以后悔的情况，需要理清思绪才行。

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