[LeetCode] 123. Best Time to Buy and Sell Stock III

Best Time to Buy and Sell Stock III

Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete at most two transactions.
Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:
Input: [3,3,5,0,0,3,1,4]
Output: 6
Explanation: Buy on day 4 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.
Then buy on day 7 (price = 1) and sell on day 8 (price = 4), profit = 4-1 = 3.

Example 2:
Input: [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
engaging multiple transactions at the same time. You must sell before buying again.

Example 3:
Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

解析

最多两次交易，求收益最大值。

解法

用四个变量来维护当前最大值，分别是第一次买入，第一次出售，第二次买入，第二次出售。

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int size = prices.size();
        int buy1 = INT_MIN, buy2 = INT_MIN;
        int sell1 = 0, sell2 = 0;
        for(int i=0;i<size;i++){
            buy1 = max(buy1, -prices[i]);
            sell1 = max(sell1, buy1+prices[i]);
            buy2 = max(buy2, sell1-prices[i]);
            sell2 = max(sell2, buy2+prices[i]);
        }
        return max(0,sell2);
    }
};

Best Time to Buy and Sell Stock IV

跟上面一样，就是变成最多k次交易，用两个数组保存buy和sell的值。

class Solution {
public:
    int maxProfit(int k, vector<int>& prices) {
        int size = prices.size();
        if(k<=0)
            return 0;
        if (k > size/2){   // simple case
            int ans = 0;
            for (int i=1; i<size; ++i){
                ans += max(prices[i] - prices[i-1],0);
            }
            return ans;
        }
        vector<int> buy(k+1, INT_MIN);
        vector<int> sell(k+1, 0);
        for(int i=0;i<size;i++){
            for(int j=1;j<=k;j++){
                buy[j] = max(buy[j], sell[j-1]-prices[i]);
                sell[j] = max(sell[j], buy[j] + prices[i]);
            }
        }
        return max(0,sell[k]);
    }
};

参考

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/discuss/39611/Is-it-Best-Solution-with-O(n)-O(1).