leetcode——309——Best Time to Buy and Sell Stock with Cooldown

最新推荐文章于 2019-04-19 20:42:17 发布

happyxuma1991

最新推荐文章于 2019-04-19 20:42:17 发布

阅读量227

点赞数

分类专栏： leetcode 面试题

本文链接：https://blog.csdn.net/happyxuma1991/article/details/51286113

版权

leetcode 同时被 2 个专栏收录

277 篇文章 0 订阅

订阅专栏

面试题

23 篇文章 0 订阅

订阅专栏

Say you have an array for which the i^th 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 = 3transactions = [buy, sell, cooldown, buy, sell]

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int n=prices.size();
        if(!n)return 0;
        int *sell=new int[n];//第i天不持有股票时
        int *buy=new int[n];//第i天持有股票
        sell[0]=0;
        buy[0]=-prices[0];
        for(int i=1;i<n;i++){
            sell[i]=max(buy[i-1]+prices[i],sell[i-1]);
            if(i>1){
                buy[i]=max(buy[i-1],sell[i-2]-prices[i]);
            }else{
                buy[i]=max(buy[i-1],-prices[i]);
            }
        }
        return sell[n-1];

        
    }
};