【Leetcode】：Best Time to Buy and Sell Stock with Cooldown 问题 in JAVA

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)

这是一道股票买卖的问题，加了一个特殊条件，卖出以后要隔一天才能交易，这道题花了我好久的时间，期间参考了“http://www.cnblogs.com/grandyang/p/4997417.html”

buy：算上当天的操作，至今为止的最后一次操作为买时的最大受益

sell：算上当天的操作，至今为止的最后一次操作为卖时的最大收益

rest：算上当天的操作，至今为止的最后一次操作为空时的最大收益

加上p代表，上一天的情况

由于可能股价是一路下跌的，会出现一次交易都不发生的情况，需要做一下判断

return Math.max(sell, rest);

下面表象上看会出现两次buy的情况，但是这是不会发生的，因为一定有p_rest >= p_buy

            buy = Math.max(p_rest-prices[i], p_buy); 

------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

public class Solution {
    public int maxProfit(int[] prices) {
        if (prices.length <= 1) {
            return 0;
        }
        if (prices.length == 2) {
            if (prices[1] > prices[0]) {
                return prices[1] - prices[0];
            }
            return 0;
        }
        
        int p_buy = -prices[0], buy;
        int p_sell = Integer.MIN_VALUE, sell = 0;
        int p_rest = 0, rest = 0;
        
        for (int i = 1; i < prices.length; i++) {
            buy = Math.max(p_rest-prices[i], p_buy); 
            sell = Math.max(p_buy+prices[i], p_sell);
            rest = Math.max(Math.max(p_sell, p_buy),  p_rest);
            
            p_buy = buy;
            p_sell = sell;
            p_rest = rest;
            
        }
        return Math.max(sell, rest);
    }
}