best-time-to-buy-and-sell-stock-with-cooldown

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an array <code>prices</code> where <code>prices[i]</code> is the price of a given stock on the <code>ith</code> day.

Find the maximum profit you can achieve. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times) with the following restrictions:

<ul>
	<li>After you sell your stock, you cannot buy stock on the next day (i.e., cooldown one day).</li>
</ul>

Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

&nbsp;
Example 1:

<pre>
Input: prices = [1,2,3,0,2]
Output: 3
Explanation: transactions = [buy, sell, cooldown, buy, sell]
</pre>

Example 2:

<pre>
Input: prices = [1]
Output: 0
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= prices.length &lt;= 5000</code></li>
	<li><code>0 &lt;= prices[i] &lt;= 1000</code></li>
</ul>

maxProfit

Best Time to Buy and Sell Stock with Cooldown

Best Time to Buy and Sell Stock

best-time-to-buy-and-sell-stock

买卖股票的最佳时机

Best Time to Buy and Sell Stock II

best-time-to-buy-and-sell-stock-ii

买卖股票的最佳时机 II

Array

Dynamic Programming

给定一个整数数组<meta charset="UTF-8" /><code>prices</code>，其中第&nbsp;&nbsp;<code>prices[i]</code>&nbsp;表示第&nbsp;<code>i</code>&nbsp;天的股票价格 。​

设计一个算法计算出最大利润。在满足以下约束条件下，你可以尽可能地完成更多的交易（多次买卖一支股票）:

<ul>
	<li>卖出股票后，你无法在第二天买入股票 (即冷冻期为 1 天)。</li>
</ul>

注意：你不能同时参与多笔交易（你必须在再次购买前出售掉之前的股票）。

&nbsp;

示例 1:

<pre>
输入: prices = [1,2,3,0,2]
输出: 3 
解释: 对应的交易状态为: [买入, 卖出, 冷冻期, 买入, 卖出]</pre>

示例 2:

<pre>
输入: prices = [1]
输出: 0
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= prices.length &lt;= 5000</code></li>
	<li><code>0 &lt;= prices[i] &lt;= 1000</code></li>
</ul>