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

贪心：只要明天的价格比今天的高，就可以买卖，也可以找到组最高的价格卖出，不过必须保证是连续几天上升的

int maxProfit(int* prices, int pricesSize) {
    //应该是贪心算法吧，只要是后一天比前一天的价格高就可以买卖
    //我写的不是每天都交易，而是找到比今天价格高的连续几天的最高点，然后卖出
    if(pricesSize == 1){
        return 0;
    }
    int res = 0;
    int pre,late;
    pre = late = 0;
    for(int i=0;i<pricesSize;i++){
        if(prices[i]>prices[late]){
            late = i;
        }
        else{
            res += prices[late]-prices[pre];
            pre = late =i;
        }
    }
    if(pre<late){
        res+=prices[late]-prices[pre];
    }
    return res;
}