Package g0101_0200.s0123_best_time_to_buy_and_sell_stock_iii

Class Solution

java.lang.Object
g0101_0200.s0123_best_time_to_buy_and_sell_stock_iii.Solution
public class Solution extends Object
123 - Best Time to Buy and Sell Stock III.<p>Hard</p> <p>You are given an array <code>prices</code> where <code>prices[i]</code> is the price of a given stock on the <code>ith</code> day.</p> <p>Find the maximum profit you can achieve. You may complete <strong>at most two transactions</strong>.</p> <p><strong>Note:</strong> You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> prices = [3,3,5,0,0,3,1,4]</p> <p><strong>Output:</strong> 6</p> <p><strong>Explanation:</strong> 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.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> prices = [1,2,3,4,5]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> 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.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> prices = [7,6,4,3,1]</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> In this case, no transaction is done, i.e. max profit = 0.</p> <p><strong>Example 4:</strong></p> <p><strong>Input:</strong> prices = [1]</p> <p><strong>Output:</strong> 0</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= prices.length <= 10<sup>5</sup></code></li> <li><code>0 <= prices[i] <= 10<sup>5</sup></code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • maxProfit

      public int maxProfit(int[] prices)