151. Best Time to Buy and Sell Stock IV
HardDynamic Programming
You are given an integer array prices where prices[i] is the price of a given stock on the ith day, and an integer k. Find the maximum profit you can achieve. You may complete at most k transactions: i.e. you may buy at most k times and sell at most k times. Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
Examples
Input: 2 [3,2,6,5,0,3]
Output: 7
Explanation: Two transactions: buy 2 sell 6 (+4), buy 0 sell 3 (+3).
Constraints
- 1 <= k <= 100
- 1 <= prices.length <= 1000
- 0 <= prices[i] <= 1000
Loading...
Run checks all cases above. Submit evaluates all test cases.