股票的最大利润（冷却期）

2019独角兽企业重金招聘Python工程师标准>>>

Best Time to Buy and Sell Stock with Cooldown

问题：

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 as many transactions as you like (ie, buy one and sell one share of the stock multiple times) with the following restrictions:

• You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
• After you sell your stock, you cannot buy stock on next day. (ie, cooldown 1 day)

Example:

prices = [1, 2, 3, 0, 2]
maxProfit = 3
transactions = [buy, sell, cooldown, buy, sell]

解决：https://www.cnblogs.com/grandyang/p/4997417.html

① 动态规划，可以买入卖出多次，但是冷却时间是一天。

假设三个一维数组buy, sell，和rest：

buy[i]表示在第i天之前最后一个操作是买，此时的最大收益。

sell[i]表示在第i天之前最后一个操作是卖，此时的最大收益。

rest[i]表示在第i天之前最后一个操作是冷冻期，此时的最大收益。

递推公式为：

buy[i]  = max(rest[i-1] - price, buy[i-1]) 
sell[i] = max(buy[i-1] + price, sell[i-1])
rest[i] = max(sell[i-1], buy[i-1], rest[i-1])

在买之前有冷冻期，买之前要卖掉之前的股票。由题目可知buy[i] <= sell[i]，即rest[i] = max(sell[i-1], rest[i-1])。

由于冷冻期的存在，我们可以得出rest[i] = sell[i-1]，这样，我们可以将上面三个递推式精简到两个：

buy[i]  = max(sell[i-2] - price, buy[i-1]) 
sell[i] = max(buy[i-1] + price, sell[i-1])

class Solution {//18ms
    public int maxProfit(int[] prices) {
        if (prices == null || prices.length == 0){
            return 0;
        }
        int[] sell = new int[prices.length];//表示i天之前最后一个操作是卖时的最大收益
        int[] buy = new int[prices.length];;//表示i天之前最后一个操作是买时的最大收益
        buy[0] = -prices[0];
        sell[0] = 0;
        for (int i = 1;i < prices.length;i ++){
            sell[i] = Math.max(sell[i - 1],buy[i - 1] + prices[i]);
            if (i >= 2){
                buy[i] = Math.max(buy[i - 1],sell[i - 2] - prices[i]);
            }else{
                buy[i] = Math.max(buy[i - 1],- prices[i]);
            }
        }
        return sell[prices.length - 1];
    }
}

② 由于i只依赖于i-1和i-2，所以我们可以在O(1)的空间复杂度完成算法。

class Solution {//17ms
    public int maxProfit(int[] prices) {
        if (prices == null || prices.length == 0){
            return 0;
        }
        int curbuy = -prices[0];
        int cursell = 0;
        int presell = 0;
        for (int i = 0;i < prices.length;i ++){
            int tmp = cursell;
            cursell = Math.max(cursell,curbuy + prices[i]);
            if (i >= 2){
                curbuy = Math.max(curbuy,presell - prices[i]);
            }else{
                curbuy = Math.max(curbuy,-prices[i]);
            }
            presell = tmp;
        }
        return cursell;
    }
}

③ 在discuss中看到的。

class Solution {//19ms
    public int maxProfit(int[] prices) {
        if (prices == null || prices.length == 0){
            return 0;
        }
        int sell = 0;
        int pre_sell = 0;
        int buy = Integer.MIN_VALUE;
        int pre_buy = Integer.MIN_VALUE;
        for (int price : prices){
            pre_buy = buy;
            buy = Math.max(pre_sell - price,pre_buy);
            pre_sell = sell;
            sell = Math.max(pre_buy + price,pre_sell);
        }
        return sell;
    }
}

 

转载于:https://my.oschina.net/liyurong/blog/1592846