[122. Best Time to Buy and Sell Stock II] #leetcode

122_1015.py

class Solution(object):
  # O(n) O(1)
    def maxProfit(self, prices):
        """
        :type prices: List[int]
        :rtype: int
        """
        
        # result placeholder
        max_profit = 0
        
        # loop prices
        for pre, cur in zip(prices[:-1], prices[1:]):
            if pre < cur:
                max_profit += cur - pre
    
        # return 
        return max_profit