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).
买进卖出的次数不受限制,唯一的要求就是本次买进之前必须先对上次的买进进行卖出。
public class Solution { //360ms
public int maxProfit(int[] prices) {
int len = prices.length;
int i = 1;
int max = 0;
while (i < len){
if (prices[i] > prices[i - 1]){
max += prices[i] - prices[i - 1];
}
i ++;
}
return max;
}
}