zoukankan      html  css  js  c++  java
  • 309. 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]

    此题有点偏难,先上代码:

    public class Solution {

        public int maxProfit(int[] prices) {

            int pre_buy = 0;

            int pre_sell = 0;

            int buy = Integer.MIN_VALUE;

            int sell = 0;

            for(int i=0;i<prices.length;i++){

                pre_buy = buy;

                buy = Math.max(pre_buy,pre_sell-prices[i]);

                pre_sell = sell;

                sell = Math.max(pre_sell,pre_buy+prices[i]);

            }

            return sell;

        }

    理由如下:

     

    buy[i] = Math.max(buy[i-1],sell[i-2]-prices[i]);

    sell[i] = Math.max(sell[i-1],buy[i-1]+prices[i]);

    其中,sell[i-2]-prices[i]里面,i-1操作为cooldown的时间,就有了如上的代码。

     

  • 相关阅读:
    关于ubantu在VMWARE里安装时出现'SMBus Host Controller not enabled'
    临时备忘录
    第七届 山东ACM热身赛 Dwarf Tower
    数学问题题目连接
    蓝桥杯2016决赛 凑平方数
    博弈整理(取物)
    格子刷油漆(DP)
    蓝桥杯第六届总决赛B组
    蓝桥杯第五届决赛B组
    蓝桥杯第四届总决赛
  • 原文地址:https://www.cnblogs.com/codeskiller/p/6358742.html
Copyright © 2011-2022 走看看