Best Time to Buy and Sell Stock with Transaction Fee

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

链接：https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/

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

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.

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

Solution

class Solution {
public:
  typedef vector<int> veci;
  int maxProfit(vector<int>& prices, int fee) {
    int size = prices.size();
    vector<veci > dp;
    dp.resize(size, veci());
    for (int i = 0; i < size; i++) dp[i].resize(2);
    dp[0][0] = 0;
    dp[0][1] = -prices[0];
    for (int i = 1; i < size; 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[size-1][0], dp[size-1][1]);
  }
};

思路：dp[i][0]表示第i天没有share时（昨天没有share，今天也没有share或者是昨天有share但是今天卖出去）的最大值；dp][i][1]表示第i天有share时（昨天有share，今天也有share或者昨天没有share但是今天买进来了）的最大值。最后返回最后一天两者中的最大值即可。