best-time-to-buy-and-sell-stock-iii leetcode C++

最新推荐文章于 2021-04-10 14:46:54 发布

原创最新推荐文章于 2021-04-10 14:46:54 发布 · 264 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C #leetcode #牛客网 #算法

算法同时被 3 个专栏收录

149 篇文章

订阅专栏

Algorithm

147 篇文章

订阅专栏

牛客网

146 篇文章

订阅专栏

本文介绍了一种算法，用于计算给定股票价格数组中通过至多两笔交易获得的最大利润。该算法遵循特定规则：不能同时进行多次交易，即卖出股票后才能再次购买。通过四个变量跟踪买入和卖出的最佳时机。

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 at most two transactions.

Note: You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

C++

class Solution {
public:
    int maxProfit(vector<int>& prices){
        int buy1 = INT_MIN;
        int sell1 = 0;
        int buy2 = INT_MIN;
        int sell2 = 0;
        for(int i = 0; i< prices.size(); i++){
            buy1 = max(buy1,-prices[i]);
            sell1 = max(sell1,buy1 + prices[i]);
            buy2 = max(buy2, sell1 - prices[i]);
            sell2 = max(sell2,buy2 + prices[i]);
        }
       return sell2;
    }
};