Best Time to Buy and Sell Stock IV

最新推荐文章于 2024-09-27 15:30:00 发布

Goofiness

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量81

点赞数

分类专栏： leetcode 文章标签： leetcode python

本文链接：https://blog.csdn.net/byr_wy/article/details/84977159

版权

leetcode 专栏收录该内容

232 篇文章 0 订阅

订阅专栏

Best Time to Buy and Sell Stock IV

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.
Note:
You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

Example

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.

Solution

class Solution:
    def maxProfit(self, k, prices):
        """
        :type k: int
        :type prices: List[int]
        :rtype: int
        """
        lenth = len(prices)
        ret = 0
        if lenth<2:
            return ret
        if lenth//2<k:
            for i in range(1,lenth):
                if prices[i]>prices[i-1]:
                    ret+= prices[i]-prices[i-1]
            return ret
        
        local_list = [0]*(k+1)
        global_list = [0]*(k+1)
        for i in range(1,lenth):
            diff = prices[i]-prices[i-1]
            for j in range(k, 0, -1):
                local_list[j] = max(global_list[j-1]+max(diff, 0), local_list[j]+diff)
                global_list[j] = max(global_list[j], local_list[j])
        return global_list[k]