122 Best Time to Buy and Sell Stock II [Leetcode]

题目内容：

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 result(0);
for(int i = 1; i < prices.size(); ++i) {
int delta(prices[i] - prices[i-1]);
if(prices[i] - prices[i-1] > 0) {
result += delta;
}
}
return result;
}
};