Problem#122 Best Time to Buy and Sell Stock II

Problem

Solution

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