Best Time to Buy and Sell Stock II

lcpy gen -n 122   # by problem number
lcpy gen -s best_time_to_buy_and_sell_stock_ii   # by problem name

Input: prices = [7,1,5,3,6,4]
Output: 7

Input: prices = [1,2,3,4,5]
Output: 4

Input: prices = [7,6,4,3,1]
Output: 0

class Solution:
    # Time: O(n)
    # Space: O(1)
    def max_profit(self, prices: list[int]) -> int:
        profit = 0

        for day in range(1, len(prices)):
            # Capture every positive upswing; sum equals any multi-day strategy
            if prices[day] > prices[day - 1]:
                profit += prices[day] - prices[day - 1]

        return profit