Say you have an array for which the ith element is the price of a given stock on day i. （Medium）
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).
分析：
贪心的思路，如果这一天的股价比前一天高则将其加入到结果中。
代码：
1 class Solution { 2 public: 3 int maxProfit(vector<int>& prices) { 4 int result = 0; 5 for (int i = 1; i < prices.size(); ++i) { 6 if (prices[i] > prices[i - 1]) { 7 result += (prices[i] - prices[i - 1]); 8 } 9 } 10 return result; 11 } 12 };