[Amazon] Best Time to Buy and Sell Stock With Multiple Transactions

Problem: Say you have an array prices 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:

Input: prices = [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.
Total profit is 4 + 3 = 7.

Approach: Not much to say here. It's a simple greedy approach. You can understand the approach by just looking at the implementation. 

Implementation in C#:

    public int MaxProfit(int[] prices)

    {

        int length = prices?.Length ?? 0;

        if (length <= 1)

        {

            return 0;

        }

        int i = 0, result = 0;

        while (i < length)

        {

            while (i < length - 1 && prices[i] >= prices[i + 1])

            {

                ++i;

            }

            int buyIndex = i;

            while (i < length - 1 && prices[i] < prices[i + 1])

            {

                ++i;

            }

            int sellIndex = i;

            result += Math.Max(0, prices[sellIndex] - prices[buyIndex]);

            ++i;

        }

        return result;

    }

Complexity: O(n)