122. Best Time to Buy and Sell Stock II (Замена каты на leetcode)

[DNPotapov]

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

        return res

[DNPotapov]

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/