题目：
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).
分析：同题目 Best Time to Buy and Sell Stock ，这些只要注意 叠加每一小段的收益
代码：
public int maxProfit(int[] prices) { if(prices == null || prices.length == 0) return 0; int min = prices[0], max = prices[0]; int result = 0; for (int i = 1; i < prices.length; i++) { if (prices[i] > max) { // 叠加每一小段的收益 max = prices[i]; result += max - min; min = prices[i]; } else if (prices[i] < min) { // 重新规定查找区域 min = prices[i]; max = prices[i]; } } return result; }