Best Time to Buy and Sell Stock II



Say you have an array for which the i^th 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).

这道题目和第一版类似，不过这次交易的次数没有限制。

既然交易的次数没有限制，也就是说我们每天都可以交易，所以我们可以从头到尾扫一遍这个数组，只要发现当前的价格比前一天高，我们就假定昨天买了股票，今天把它卖掉，也就是说只要当前的价格比前一天的高，我们就把差价加到利润中，这样扫到最后时得到的利润就是最大的利润。

这个算法只有一个循环，复杂度是O(n)，以下是源代码：

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