Question
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).
Stats
| Frequency | 1 |
| Difficulty | 3 |
| Adjusted Difficulty | 1 |
| Time to use | -------- |
Ratings/Color = 1(white) 2(lime) 3(yellow) 4/5(red)
Solution
This solution is best explained here.
就从左到右轮一遍，遇到递增的都给加起来呗。
Code
public int maxProfit(int[] prices) {
int len = prices.length;
if (len <= 1) return 0;
int profit = 0;
for (int i = 1; i < len; i ++)
profit += Math.max(0, prices[i] - prices[i-1]);
return profit;
}