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

题目其实很简单 就是给了一个数组 a[i]表示第i天股票价值，要求的是你怎么买卖能获得最大收益，不用考虑太多边界问题和复杂的问题，题目给的参数是引用 直接修改vector 把值变成股票价值增幅数组， 然后求这个数组中所有大于0的值的和就是了。

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        int max = 0, len = prices.size();
		if (len == 0 || len == 1)
			return 0;
		for (int i = 0; i < len - 1; ++i)
		{
			prices[i] = prices[i + 1] - prices[i];
		}
		for (int i = 0; i < len - 1; ++i)
		{
			if (prices[i] > 0)
				max += prices[i];
		}
		return max;
    }
};