Leetcode309

动态规划

buy[i] 第i天买进彩票得到的最多收益

sell[i] 第i天卖出彩票得到的最多收益

cool[i] 第i天冷却得到的最多收益

方程和初始值看代码吧

    public int maxProfit(int[] prices) {
        if (prices == null || prices.length == 1) return 0;
        int[] buy = new int[prices.length];
        int[] sell = new int[prices.length];
        int[] cool = new int[prices.length];
        buy[0] = -prices[0];
        sell[0] = 0;
        cool[0] = 0;
        for (int i = 1; i < prices.length; i++) {
            buy[i] = Math.max(buy[i - 1], cool[i - 1] - prices[i]);
            sell[i] = Math.max(sell[i - 1], buy[i - 1] + prices[i]);
            cool[i] = Math.max(cool[i - 1], Math.max(buy[i - 1], sell[i - 1]));
        }
        return sell[prices.length - 1];
    }