leetcode|[leetcode]188. Best Time to Buy and Sell Stock IV leetcode|动态规划

链接：https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/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 k transactions.
【leetcode|[leetcode]188. Best Time to Buy and Sell Stock IV】Note:
You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
Example 1:

Input: [2,4,1], k = 2 Output: 2 Explanation: Buy on day 1 (price = 2) and sell on day 2 (price = 4), profit = 4-2 = 2.

Example 2:

Input: [3,2,6,5,0,3], k = 2 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.

leetcode|[leetcode]188. Best Time to Buy and Sell Stock IV

文章图片

class Solution { public: int maxProfit(int k, vector& prices) { int size=prices.size(); if(k==0 || size==0) return 0; if(k>(size/2) && size>=2) k=size/2; vector hold(k,INT32_MIN); vector sold(k,0); for(int price : prices) { for(int j=0; jhold, sold->hold sold[j] = max(sold[j], hold[j]+price); // sold->sold, hold->sold } } return sold[k-1]; } };