Best Time to Buy and Sell Stock系列分析

• Best Time to Buy and Sell Stock
  https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/
  题目描述：只能进行一次交易
  那么我们找到差值最大的两个数，并且后面的值比较大即可。

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

• Best Time to Buy and Sell Stock II
  https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/
  题目描述：可以进行不止一次交易，但每次交易不能重叠
  如果后一个值比前一个值大，我们就进行一次交易，得到局部最优值之和。
  局部最优值>=全局最优值

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

• Best Time to Buy and Sell Stock III
  https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/description/
  题目描述：明确规定最多只能进行两次交易
  将问题拆分成两个子问题，第0天到第cc天，第cc+1天到最后一天

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        const int size = prices.size();
        if(size<2){
            return 0;
        }
        int profit1[size+1], profit2[size+1];
        int minprice = prices[0];
        int maxprice = prices[size-1];
        profit1[0] = 0;
        for(int i=1;i<size;i++){
            profit1[i] = max(profit1[i-1], prices[i] -  minprice);
            if(minprice > prices[i]){
                minprice = prices[i];
            }
        }
        profit2[size-1] = 0;
        for(int i=size-2;i>=0;i--){
            profit2[i] = max(profit2[i+1], maxprice - prices[i]);
            if(maxprice < prices[i]){
                maxprice = prices[i];
            }
        }
        int global = 0;
        for(int i=0;i<size;i++){
            global = max(global, profit1[i]+profit2[i]);
        }

        return global;
    }


};

• Best Time to Buy and Sell Stock IV
  来自 https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/discuss/
  题目描述：明确规定最多只能进行k次交易
  将问题拆分成k个子问题，第0天到第cc天，第cc+1天到最后一天
  用global和local来更新，考虑到第j天的交易可能跟第j-1天重复了 本来是1次交易但记录成两次
  另外，如果k很大的时候，退化成第二种问题。注意，当k很大的时候，我们开数组的时候要小心，不然会爆掉，然后Runtime error
  local[j] = max(global[j-1]+max(diff,0), local[j]+diff);
  global[j] = max(local[j], global[j]);

class Solution {
public:
    int maxProfit(int k, vector<int>& prices) {
        int size = prices.size();
        if(size<2){
            return 0;
        }
        if(k>=size){
            return solveMaxProfit(prices);
        }
        int local[k+1]={0};//k太大的时候 创建数组的时候爆掉了···
        int global[k+1]={0};
        for(int i=0;i<size-1;i++){
            int diff = prices[i+1]-prices[i];
            for(int j=k;j>=1;j--){
                local[j] = max(global[j-1]+max(diff,0), local[j]+diff);
                global[j] = max(local[j], global[j]);
            }
        }
        return global[k];

    }
    int solveMaxProfit(vector<int>& prices) {
        int size = prices.size();
        int result = 0;
        for(int i=1;i<size;i++){
            if(prices[i] - prices[i-1]>0){
                result += prices[i]-prices[i-1];
            }
        }
        return result;
    }
};