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).
翻译:
假设你有一个数组,其中第i 个元素是第i天给定股票的价格。
设计一个算法来找到最大的利润。您可以根据需要完成尽可能多的交易(即,购买一次并多次出售股票)。但是,您可能不会同时从事多个交易(即,您必须在再次购买之前先出售该股票)。
思路:
太水了,一直自己没有什么思路,就看了答案思路,遍历数组,只要后一位比前一位大,就将差值加入到结果中,可以看成将数组分成许多小的序列,每次都找一个从小到大的序列,求出最大值和最小的差值,而这一过程可以分为将每次的差值累加。
public int maxProfit(int[] prices) {
int result = 0;
for(int i =0;i<prices.length-1;i++){
if(prices[i+1]>prices[i]){
result+=prices[i+1]-prices[i];
}
}
return result;
}