每日一题 day 35 (DP topic)

122. Best Time to Buy and Sell Stock II
You are given an integer array prices where prices[i] is the price of a given stock on the ith day.

On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day.

Find and return the maximum profit you can achieve.

Example 1:

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.

Example 2:

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

Example 3:

Input: prices = [7,6,4,3,1]
Output: 0
Explanation: There is no way to make a positive profit, so we never buy the stock to achieve the maximum profit of 0.

my solution

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int pre, curr, res = 0, buy = 0, sell = prices.size()-1;
        bool flag = false;
        for(int i=1; i<prices.size()-1; i++){
            pre = prices[i]-prices[i-1];
            curr = prices[i+1]-prices[i];
            if(pre <= 0 && curr >= 0){
                buy = i;
                flag = true;
            }
            if(pre > 0 && curr <= 0){
                sell = i;
                res += prices[sell] - prices[buy];
                flag = false;
            }
        }
        if(flag) res += prices[prices.size()-1] - prices[buy];
        if(res != 0)return res;
        else if(prices[sell] - prices[buy] > 0)
            return prices[sell] - prices[buy];
        else return 0;
    }
};

solution 2 good solution

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int res = 0, i = 0, buy, sell;
        while(i < prices.size()-1){
            while(i < prices.size()-1 && prices[i+1] <= prices[i]) ++i;
            buy = prices[i];
            while(i < prices.size()-1 && prices[i+1] > prices[i]) ++i;
            sell = prices[i];
            res += sell - buy;
        }
        return res;
    }
};

solution 3 best and fastest solution

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

best and classical solution

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int hold = INT_MIN;
        int not_hold = 0;
        for(auto price : prices){
            int tmp1 = hold, tmp2 = not_hold;
            hold = max(tmp1, tmp2-price);
            not_hold = max(tmp2, tmp1+price);
        }
        return not_hold;
    }
};

NOTE