class Solution {
public int maxProfit(int[] prices) {
int res = 0;
for(int i = 0;i < prices.length -1;i++){
if(prices[i] < prices[i + 1] ) res += (prices[i+1] - prices[i]);
}
return res;
}
}
因为没有手续费,只收集每天的正利润即可