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

这道题与 121. Best Time to Buy and Sell Stock 很相似，也是股票买进卖出求最大利润，不同的是可以多次操作。

思路：

要想得到最大利润，就要每次都低价买入，高价卖出。由下图可知，每次价格下降前卖出，下降后买入，比最高点卖出，最低点买入利润要大。因此我们遍历数组，记录下每段单调递增的段的起始位置，到下降点时，计算这一段首末差值作为当次交易的利润值，再把下降点看作下一段的起始点，以此类推向后计算。最终每次交易的利润和就是总的利润。

代码如下：

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

相似题目：

Leetcode 121.Best Time to Buy and Sell Stock