leetcode-腾讯精选50题-29

最新推荐文章于 2021-10-20 21:57:13 发布

__y__

最新推荐文章于 2021-10-20 21:57:13 发布

阅读量106

点赞数

本文链接：https://blog.csdn.net/qq_34354951/article/details/101216113

版权

122. Best Time to Buy and Sell Stock II

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 as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).

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

只需找到所有当前天数比前一天的钱多，那么就保存该交易，当比前一天少时，不交易

    def maxProfit(self, prices: List[int]) -> int:
        res = 0
        for i in range(1, len(prices)):
            temp = prices[i] - prices[i - 1]
            if temp > 0:
                res += temp
        return res