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 (i.e., buy one and sell one share of the stock multiple times).
Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).
Example 1:
Input: [7,1,5,3,6,4] Output: 7 Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4. Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.Example 2:
Input: [1,2,3,4,5] Output: 4 Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4. Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are engaging multiple transactions at the same time. You must sell before buying again.Example 3:
Input: [7,6,4,3,1] Output: 0 Explanation: In this case, no transaction is done, i.e. max profit = 0.
问题描述： 给定一个数组，每一位代表当前索引的价格。设计一个算法，计算出最大利润。可以多次买卖。但是买卖不能在同一天操作
思路：这一题用到了贪心的思想。通过获取局部局部最优来达到整体最优解。找到递减区间的最低点，及最后一个点，同时再找到递增区间的最高点，也是最后一个点。把他们的差值累加，获得最大利润
public static int MaxProfit2(int[] prices) { int len = prices.Length; int total = 0; int i = 0; while(i < len - 1) { int sell =0, buy = 0; while (i + 1 < len && prices[i + 1] < prices[i])//获取递减区最低点（局部最小） i++; buy = i;//将最小点作为买入点 i++;//找下一个点，卖出点至少是买入点的下一个点 while (i < len && prices[i] > prices[i - 1])//获取递增区最高点（局部最大） i++; sell = i - 1;//获取卖出点 total += prices[sell] - prices[buy]; } return total; }
想法来源： https://www.cnblogs.com/grandyang/p/4280803.html