122. Best Time to Buy and Sell Stock II

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).

Subscribe to see which companies asked this question.

此题很121的题相似，不过这道题求的是可以多次买多次卖的利润最大化。可以从头到尾扫描，如果price[i]
– price[i-1]

那么，计入total。贪心法。

public int maxProfit1(int[] prices) {
int total = 0;
for (int i=0; i< prices.length-1; i++) {
if (prices[i+1]>prices[i]) total += prices[i+1]-prices[i];
}
return total;
}