leetcode 123. Best Time to Buy and Sell Stock III(经典DP)

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.
用DP数组保留前k次卖出的最优情况
用W数组保留买入的最优情况

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int l = prices.size();
        if(l==0)return 0;
        int w[l+1][2]={0},dp[l+1][2]={0};
        w[0][0]=w[0][1]=-prices[0];
        for(int i=1;i<l;i++)
        {
                dp[i][1]=max(dp[i-1][1],w[i-1][1]+prices[i]);
                w[i][1]=max(w[i-1][1],dp[i-1][0]-prices[i]);
                dp[i][0]=max(dp[i-1][0], w[i-1][0]+prices[i]);
                w[i][0]=max(w[i-1][0],-prices[i]);
        }
        return dp[l-1][1];
    }
};