123. Best Time to Buy and Sell Stock III

最新推荐文章于 2024-01-20 11:34:17 发布

林下溪源

最新推荐文章于 2024-01-20 11:34:17 发布

阅读量66

点赞数

分类专栏： LeetCode # Arrays 文章标签： LeetCode 算法 Java

本文链接：https://blog.csdn.net/zzyy17/article/details/102727753

版权

LeetCode 同时被 2 个专栏收录

117 篇文章 0 订阅

订阅专栏

Arrays

79 篇文章 0 订阅

订阅专栏

Problem 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 (i.e., you must sell the stock before you buy again).

Example 1:
Input: [3,3,5,0,0,3,1,4]
Output: 6
Explanation: Buy on day 4 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.
             Then buy on day 7 (price = 1) and sell on day 8 (price = 4), profit = 4-1 = 3.
Example 2:
Input: [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
             Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
             engaging multiple transactions at the same time. You must sell before buying again.
Example 3:
Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

Analysis:

这个思路是借鉴某位大神的思路，模拟整个流程最终得出结果。

buy1[i] = max( - prices[i], buy1[i - 1])
sell1[i] = max(buy1[i - 1] + price[i], sell1[i - 1])
buy2[i] = max( sell1[i -1] - prices[i], buy2[i - 1])
sell2[i] = max(buy2[i - 1] + price[i], sell2[i - 1])

代码如下：

Code:

class Solution {
    public int maxProfit(int[] prices) {
        int s1 = 0, s2 = 0, b1 = Integer.MIN_VALUE, b2 = Integer.MIN_VALUE;
        for(int i = 0; i < prices.length; i++) {
            b1 = Math.max(b1, -prices[i]);
            s1 = Math.max(s1, b1 + prices[i]);
            b2 = Math.max(b2, s1 - prices[i]);
            s2 = Math.max(s2, b2 + prices[i]);
        }
        
        return s2;
    } 
}