与一非常类似。只需要改一个条件。
public class Solution {
public int maxProfit(int[] prices) {
if (prices == null || prices.length <= 1) {
return 0;
}
int max = Integer.MIN_VALUE;
int sum = 0;
for (int i = 1; i < prices.length; i++) {
int localprofit = prices[i] - prices[i - 1];
if (localprofit > 0) {
sum+=localprofit;
}
max = Math.max(max, sum);
}
return max;
}
}