LeetCode 0123 - Best Time to Buy and Sell Stock III

Best Time to Buy and Sell Stock III

Desicription

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 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).

Solution

代码语言：javascript复制

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int hold1 = INT_MIN;
        int hold2 = INT_MIN;
        int release1 = 0;
        int release2 = 0;
        for(int price : prices) {
            hold1 = max(hold1, -price);
            release1 = max(release1, hold1   price);
            hold2 = max(hold2, release1 - price);
            release2 = max(release2, hold2   price);
        }
        return release2;
    }
};

algorithm element stock time transactions

0 人点赞