【leetcode】122. Best Time to Buy and Sell Stock II (c/c++,easy难度)

原题链接 easy

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.

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.

 

---

我的代码（ps我觉得并不easy。。。参考下面的链接思路才写的出来

思路1（我写的，请略过，看代码2吧）:参考《——  考虑三种情况：1、一直下降sum=0 ；2、一直上升存在全局利润 3、上升下降交替存在局部的利润。用low 和 high标记局部的最低和最高，利润sum就是每一个局部的（high-low）的叠加，

        用pricea[i] 与 prices[i+1]的比较判断趋势是上升还是下降，并更新low和high。下降更新low，上升更新high。

       如果pricea[i] > prices[i+1] 且high>low，说明经过了一个局部上升，此时计算局部利润，并更新low为下一个index

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int len = prices.size();
        int sum = 0;
        int low = 0;
        int high = 0;
        int i;
        for(i = 0;i < len ;i++){
            if((prices[i] >= prices[i+1] && high > low) || high == len-1){//drop or increase to end
                sum += prices[i] - prices[low];
                low = i+1;
            }
            if(prices[i] < prices[i+1]){ //increase
                high = i + 1;
            }else low = i + 1;
        }
         return sum;
    }
};

代码2:

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