public class Solution {
public int maxProfit(int[] prices) {
if (prices.length<2) 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;
}
}
non-decreasing放到一组, add them.
回复删除