[Easy] 122. Best Time to Buy and Sell Stock II

122. Best Time to Buy and Sell Stock II

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 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.

Solution

Brute Force

One Pass

Runtime: 20 ms, faster than 7.17% of C++ online submissions for Best Time to Buy and Sell Stock II.
Memory Usage: 13 MB, less than 6.35% of C++ online submissions for Best Time to Buy and Sell Stock II.

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int sumValue = 0;
        for(int i = 1; i < prices.size(); i++)
        {
            if(prices[i] > prices[i-1]) 
            {
                sumValue += prices[i] - prices[i-1];
            }
        }
        return sumValue;
    }
};

经过分析发现，如果是单调增序列，那么最大值只需要找到peak和valley即可。如图所示：

否则，需要找出每个单调增区间，并且对profit求和。如图：