Solution#1
public class Solution {
public int maxProfit(
int[] prices) {
if (prices ==
null || prices.length ==
0)
return 0;
int profit =
0;
for (
int i =
1; i < prices.length; i++) {
if (prices[i] > prices[i -
1]) {
profit += prices[i] - prices[i -
1];
}
}
return profit;
}
}
转载请注明原文地址: https://ju.6miu.com/read-3890.html