class Solution {
public int maxProfit(int[] prices) {
if(prices == null) return 0;
if(prices.length < 2) return 0;
int ret = 0;
for(int i = 1;i<prices.length; i++ ){
ret+=Math.max(0, prices[i]-prices[i-1]);
}
return ret;
}
}