题目： 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).
思路分析： 这道题《Leetcode: Best Time to Buy and Sell Stock 》类似。不过这次不限制交易次数，所以每次只要是盈利的，，我们就进行买入和卖出。
C++参考代码：
class Solution{public:int maxProfit(vector<int> &prices){vector<int>::size_type size = prices.size();if (0 == size) return 0;int result = 0;for (int i = 1; i < size; ++i){if (prices[i] – prices[i – 1] > 0) result += prices[i] – prices[i – 1];}return result;}};
Ｃ＃参考代码：
public class Solution{(int[] prices){if (prices.Length == 0) return 0;int result = 0;for (int i = 1; i < prices.Length; ++i){if (prices[i] – prices[i – 1] > 0) result += prices[i] – prices[i – 1];}return result;}}
灿烂甜美!那一瞬的激-情绽放,催人奋进!胜利,永远属于为梦想奋斗的人新乐吧
