/*
只要涨的波段,不要跌的
*/
class Solution {
public int maxProfit(int[] prices) {
if(prices == null || prices.length == 0) return 0;
int res = 0;
for(int i = 1; i < prices.length; i++) {
if(prices[i] > prices[i - 1]) {
res += prices[i] - prices[i - 1];
}
}
return res;
}
}