309.Best Time to Buy and Sell With Cooldown

发表于 | 分类于 ， | 评论数： | 阅读次数：
字数统计: 177 | 阅读时间 ≈ 1

题目描述

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: [1,2,3,0,2]
Output: 3
Explanation: transactions = [buy, sell, cooldown, buy, sell]

我的解法

实现代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int n = prices.size();
        
        // base case
        int dp_i_0 = 0;
        int dp_i_1 = INT_MIN;
        int dp_pre = 0;
        // dp
        for (int i = 0; i < n; i++){
            int tmp = dp_i_0;
            dp_i_0 = max(dp_i_0, dp_i_1 + prices[i]);
            dp_i_1 = max(dp_i_1, dp_pre - prices[i]);
            dp_pre = tmp;
        }
        return dp_i_0;
        
    }
};