[leetcode] 122. Best Time to Buy and Sell Stock II

Say you have an array for which theith 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).

这道题和第121题相关，不同的是操作次数不限，但在买入股票之前要先卖出之前买入的，让计算最大收益，题目难度为Medium。

针对每天的股价，我们可以思考，如果比昨天的股价高，我们昨天买入今天卖出，这两天的收益就拿到了，如果比昨天的股价低，昨天就不买，这样不会降低我们的收益。这样每两天之间只要有收益我们都能够拿到，降低收益的时候我们都没有买入，因而能够达到最大收益，股神！！通过以上分析可以看出这种贪婪策略能够得到最优解。具体代码：

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