Package g0101_0200.s0188_best_time_to_buy_and_sell_stock_iv

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    188 - Best Time to Buy and Sell Stock IV\.

    Hard

    You are given an integer array prices where prices[i] is the price of a given stock on the <code>i<sup>th</sup></code> day, and an integer k.

    Find the maximum profit you can achieve. You may complete at most k transactions.

    Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

    Example 1:

    Input: k = 2, prices = 2,4,1

    Output: 2

    Explanation: Buy on day 1 (price = 2) and sell on day 2 (price = 4), profit = 4-2 = 2.

    Example 2:

    Input: k = 2, prices = 3,2,6,5,0,3

    Output: 7

    Explanation: Buy on day 2 (price = 2) and sell on day 3 (price = 6), profit = 6-2 = 4. Then buy on day 5 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.

    Constraints:

    • 1 &lt;= k &lt;= 100

    • 1 &lt;= prices.length &lt;= 1000

    • 0 &lt;= prices[i] &lt;= 1000

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxProfit(Integer k, IntArray prices)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait