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 (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

Solution

If we can sell as many transactions as we like, we can then reap all the positive increments in the prices.

Python

    """
    @param: prices: Given an integer array
    @return: Maximum profit
    """
    def maxProfit(self, prices):

        n = len(prices)
        profit = 0
        for i in range(1, n):
            profit = profit + max(0, prices[i] - prices[i-1])
        return profit

Complexity Analysis:

Time: O(n)

Space: O(1)