Best Time to Buy and Sell Stock II

题目

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

与 Best Time to Buy and Sell Stock 不同的是 要将所有的递增阶段的局部最大值域局部最小值相减，并求和。

具体实现如下：

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(prices.size()<=1)
            return 0;
        int sum=0;
        int min=prices[0], max=prices[0];
        int j=1;
        while(j<prices.size())
        {
            while(prices[j]<=prices[j-1] && j<prices.size())
                j++;
            min = prices[j-1];                   
            while(prices[j]>=prices[j-1] && j<prices.size())
                j++;
            max = prices[j-1];
            if(max>min)
                sum+=max-min;                                 
        }        
        return sum;       
    }
};

 实现二：

 

class Solution {  
public:  
    int maxProfit(vector<int> &a) {  
        // Start typing your C/C++ solution below   
        // DO NOT write int main() function   
          
        int prevIdx = 0;  
        int sum = 0;  
          
        for (int i = 1; i < a.size(); ++i)  
        {  
            if (a[i] > a[prevIdx])  
            {  
                sum += a[i] - a[prevIdx];  
                  
            }  
            prevIdx = i;  
        }  
          
        return sum;  
    }  
};