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).
首先是对题意的理解:题目说明可以多次买卖,但是同一时间只能有一股在手里。某一天可以卖出该股然后买进来,运用贪心的思想:
这样就可以在每次上升子序列之前买入,在上升子序列结束的时候卖出。相当于能够获得所有的上升子序列的收益。
而且,对于一个上升子序列,比如:5,1,2,3,4,0 中的1,2,3,4序列来说,对于两种操作方案:
一,在1买入,4卖出;
二,在1买入,2卖出同时买入,3卖出同时买入,4卖出;
简单数学运算就可以发现:这两种操作下,收益是一样的。
public class Solution {
public int maxProfit(int[] prices) {
if(prices.length==0){
return 0;
}
int MaxProfit = 0;
int len = prices.length;
for(int i=1;i<len;i++){
if(prices[i]>prices[i-1]){
MaxProfit+= prices[i]-prices[i-1];
}
}
return MaxProfit;
}
}