"""
Best Time to Buy and Sell Stock II

Say you have an array for which the ith element is the 
price of a given stock on day i.

Design an algorithm to find the maximum profit. 
You may complete as many transactions as you like 
(i.e., buy one and sell one share of the stock 
multiple times).

Note: You may not engage in multiple transactions 
at the same time (i.e., you must sell the stock before 
you buy again).

Example 1:

Input: [7,1,5,3,6,4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 
(price = 5), profit = 5-1 = 4. Then buy on day 4 
(price = 3) and sell on day 5 (price = 6), 
profit = 6-3 = 3.

Example 2:

Input: [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 
(price = 5), profit = 5-1 = 4. Note that you cannot 
buy on day 1, buy on day 2 and sell them later, as 
you are engaging multiple transactions at the same time. 
You must sell before buying again.

Example 3:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, 
i.e. max profit = 0.
"""

# def max_profit(prices_list):
#     buy_price = prices_list[0]

#     max_profit = 0

#     if max(prices_list) == prices_list[0]:
#         return max_profit

#     for price in prices_list:
#         buy_price = min(min_price, price)

#         current_profit = price - min_price

#         max_profit = max(max_profit, current_profit)

#     return max_profit

def max_profit(prices):
    max_profit = 0

    for i in range(len(prices)-1):
        current_profit = prices[i+1]-prices[i]
        if current_profit > 0:
            max_profit += current_profit
    return max_profit