class Solution {
//利益最大化等价于每天都买卖
public int maxProfit(int[] prices) {
int sum = 0;
for(int i = 0 ; i < prices.length - 1; i++){
if(prices[i] < prices[i + 1]) sum += prices[i + 1] - prices[i];
}
return sum;
}
}