Leetcode 309. Best Time to Buy and Sell Stock with Cooldown
本帖最后由 Seawolf 于 2020-7-29 22:45 编辑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:
Input:
Output: 3
Explanation: transactions =
给定一个整数数组，其中第i个元素代表了第i天的股票价格.
设计一个算法计算出最大利润。在满足以下约束条件下，你可以尽可能地完成更多的交易（多次买卖一支股票）:
你不能同时参与多笔交易（你必须在再次购买前出售掉之前的股票）。
卖出股票后，你无法在第二天买入股票 (即冷冻期为 1 天)。
示例:
输入:
输出: 3
解释: 对应的交易状态为: [买入, 卖出, 冷冻期, 买入, 卖出]
class Solution:
def maxProfit(self, prices: List) -> int:
sell = 0
prevSell = 0
buy = -math.inf
for price in prices:
prevBuy = buy
buy = max(prevSell - price, prevBuy)
prevSell = sell
sell = max(prevBuy + price, prevSell)
return sell Can you send it in Chinese? 假设您有一个数组，其中第i个元素是给定股票在第一天的价格。
设计一个算法来寻找最大利润。您可以根据需要完成任意数量的交易（即多次买入一股股票并卖出一股股票），但有以下限制：
你不能同时从事多笔交易（即，你必须先卖出股票再购买）。
卖出股票后，第二天就不能买股票了。（即冷却1天）
例子：
输入：
输出：3
说明：交易=[买入，卖出，冷却，买入，卖出] aaron.yang 发表于 2020-7-29 22:10
Can you send it in Chinese?
Sure
页:
[1]