Description: 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]问题描述: 你有一个整数数组，其中元素i代表i天的股票额 设计一个算法获取最大利润。你可以做任意数目的操作(买进股票或者卖出股票多次),但是你的操作会有如下限制:
买进之前必须先卖出卖出股票后，你下一天不能买进股票解法:
/* 强烈建议看一下这个链接； https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/discuss/75927/Share-my-thinking-process */ class Solution { public int maxProfit(int[] prices) { int sell = 0, prev_sell = 0, buy = Integer.MIN_VALUE, prev_buy; for (int price : prices) { prev_buy = buy; buy = prev_sell - price > prev_buy ? prev_sell - price : prev_buy; prev_sell = sell; sell = prev_buy + price > prev_sell ? prev_buy + price : prev_sell; } return sell; } }