LeetCode 之 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 (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).

这个是LeetCode中等难度的题，大意是有一个数组存放每一天股票的价格，你可以进行多次买卖，但是最多只能持有1个股票，找到最大的获利。对于这个问题可以用贪婪算法，因为有了每一天的价格，很容易得到股票价格波动差，当股票下降时，就用之前的最大价卖出，再以当前价格买入。代码如下：

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

这是最原始的分析，其实还可以这样想，最大的利润其实就是只在股票上涨时买入，跌时不持有，所以最大利润等于相邻两天的价格差大于0时的和,或者可以理解为在上升序列开始时买，在上升子序列下降时卖出。代码如下：

int maxProfit(vector<int>& prices) {
        /*
        if(prices.size()==0) return 0;
        int index=0;
        int total=0;
        int i;
        for(i=1;i<prices.size();i++){
            if(prices[i]<prices[i-1]){
                total=total+prices[i-1]-prices[index];
                index=i;
            }
        }
        if(prices[i-1]>prices[index]){
            total=total+prices[i-1]-prices[index];
        }
        return total; */
        if(prices.size()<=1) return 0;
        int total=0;
        for (int i=1;i<prices.size();i++){
            if(prices[i]>prices[i-1]){
                total+=prices[i]-prices[i-1];
            }
        }
        return total;
    }