LeetCode--123. Best Time to Buy and Sell Stock III

最新推荐文章于 2022-02-07 21:21:56 发布

ugt278

最新推荐文章于 2022-02-07 21:21:56 发布

阅读量208

点赞数

分类专栏： LeetCode 文章标签： LeetCode Greedy sellbuy

本文链接：https://blog.csdn.net/ugt278/article/details/79028796

版权

LeetCode 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

123. Best Time to Buy and Sell Stock III

Description：

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:

It is similar to other buy/sell problems. just do DP and define an array of states to track the current maximum profits at different stages. For example, in the below code

states[][0]: one buy
states[][1]: one buy, one sell
states[][2]: two buys, one sell
states[][3]: two buy, two sells

The states transistions occurs when buy/sell operations are executed. For example, state[][0] can move to state[][1] via one sell operation.

Code：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int states[2][4] = {INT_MIN, 0, INT_MIN, 0}; // [][0]: one buy, [][1]: one buy one sell, [][2]: 2 buys 1 sell, [][3], 2 buys 2 sells
        int len = prices.size(), i, cur = 0, next =1;
        for(i=0; i<len; ++i)
        {
            states[next][0] = max(states[cur][0], -prices[i]);
            states[next][1] = max(states[cur][1], states[cur][0]+prices[i]);
            states[next][2] = max(states[cur][2], states[cur][1]-prices[i]);
            states[next][3] = max(states[cur][3], states[cur][2]+prices[i]);
            swap(next, cur);
        }
        return max(states[cur][1], states[cur][3]);
    }
};