题目描述
Say you have an array for which the i th 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).
解题思路:
只要price[i] >= price[i-1] 就可以卖掉, 然后将这些值加起来就是最大利润
public class Solution {
public int maxProfit(int[] prices) {
int max = 0;
for (int i = 1; i < prices.length; i++) {
if (prices[i] - prices[i - 1] >= 0) {
max += prices[i] - prices[i-1];
}
}
return max;
}
}