LeetCode解题报告 309. Best Time to Buy and Sell Stock with Cooldown[medium]

题目要求

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]

解题思路

有限状态机，借用leetcode该题目的discuss中的一张图示说明。

三个状态

f0[i]：第i天过后处于状态0时的最大收益

f1[i]：第i天过后处于状态1时的最大收益

f2[i]：第i天过后处于状态2时的最大收益

f0[1]=0

f1[1]=-prices[0] 买进来还没有卖掉

f2[1]＝负无穷

i>1时：

f0[i]=max(f0[i-1]，f2[i-1])

f1[i]=max( f1[i-1], f0[i-1] - prices[i-1] )

f2[i]= f1[i-1]+prices[i-1]

答案 max{ f0[n], f2[n] }

一定不可能在状态1，因为买了之后不卖肯定不是最佳的

复杂度分析

时间复杂度为O(N)。

代码如下：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int n=prices.size();
        if (n<=1) {
            return 0;
        }
        
        vector<int>f0(n,0);
        vector<int>f1(n,0);
        vector<int>f2(n,0);
        f0[0]=0;
        f1[0]=-prices[0];
        f2[0]=INT_MIN;
        
        for (int i=1; i<n; i++) {
            f0[i]=max(f0[i-1],f2[i-1]);
            f1[i]=max(f1[i-1],f0[i-1]-prices[i]);
            f2[i]=f1[i-1]+prices[i];
        }
        
        return max(f0[n-1],f2[n-1]);
    }
};