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

怎样买卖才能获取最大利益的问题。我的想法是在即将要升的时候买，在即将要降的时候卖。但看了一下讨论，发现我还是想复杂了，直接每次都算与前一次的价格差，如果价格差是正数说明有得赚，就加在结果上，不是正数的话就不管了，这样实现起来更简单。下面是两份代码：

我的：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int res=0,n=prices.size();
        bool isbuy=false;
        int buyprice,i;
        for(i=0;i<n-1;i++)
        {
        	if(prices[i]<prices[i+1])
        	{
        		if(!isbuy)
				{
					isbuy=true;
					buyprice=prices[i];
				} 
			}
			else if(prices[i]>prices[i+1])
			{
				if(isbuy)
				{
					isbuy=false;
					res+=(prices[i]-buyprice);
				}
			}
		}
		if(isbuy&&prices[i]>buyprice)
		{
			res+=(prices[i]-buyprice);
		}
		return res;
    }
};

讨论上的：

class Solution {
public:
    int maxProfit(vector<int> &prices) {
    int ret = 0;
    for (size_t p = 1; p < prices.size(); ++p) 
      ret += max(prices[p] - prices[p - 1], 0);    
    return ret;
}
};