LeetCode-309. Best Time to Buy and Sell Stock with Cooldown

最新推荐文章于 2025-04-18 23:33:23 发布

zy2317878

最新推荐文章于 2025-04-18 23:33:23 发布

阅读量148

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： LeetCode FDynamic Programming

本文链接：https://blog.csdn.net/zy2317878/article/details/80929378

LeetCode 专栏收录该内容

254 篇文章

订阅专栏

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:

1.You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
2.After you sell your stock, you cannot buy stock on next day. (ie, cooldown 1 day)

Example

Input: [1,2,3,0,2]
Output: 3 
Explanation: transactions = [buy, sell, cooldown, buy, sell]

Solution 1(C++)

class Solution{
public:
    int maxProfit(vector<int>& prices){
        if(prices.empty()) return 0;

        vector<int> buy(prices.size(), 0);
        vector<int> sell(prices.size(), 0);

        buy[0] = -prices[0];

        for(int i=1; i<prices.size(); i++){
            buy[i] = max(buy[i-1], sell[i-2] - prices[i]);
            sell[i] = max(sell[i-1], buy[i-1] + prices[i]);
        }
        return sell.back();
    }
};