zoukankan      html  css  js  c++  java
  • 309 Best Time to Buy and Sell Stock with Cooldown 买股票的最佳时间含冷冻期

    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]
    详见:https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/description/

    C++:

    class Solution {
    public:
        int maxProfit(vector<int>& prices) {
            int buy = INT_MIN, pre_buy = 0, sell = 0, pre_sell = 0;
            for (int price : prices) {
                pre_buy = buy;
                buy = max(pre_sell - price, pre_buy);
                pre_sell = sell;
                sell = max(pre_buy + price, pre_sell);
            }
            return sell;
        }
    };
    

     参考:https://www.cnblogs.com/grandyang/p/4997417.html

  • 相关阅读:
    mysql修改加密方式
    信息安全学习路线
    DNS域传送漏洞
    CSRF漏洞
    反序列化漏洞
    计算机通讯基础
    gorm gen使用
    golang makefile使用
    linux命令行录制
    go代码自动生成注释
  • 原文地址:https://www.cnblogs.com/xidian2014/p/8831196.html
Copyright © 2011-2022 走看看