122. Best Time to Buy and Sell Stock II

Solution 1: DP

Time Complexity: O(N)
Space Complexity: O(1)

Solution 2: Geedy

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

Time Complexity: O(N)
Space Complexity: O(1)

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/discuss/803206/PythonJSJavaGoC%2B%2B-O(n)-by-DP-Greedy-%2B-Visualization