思路: 就是贪心 ,比前一天的大就卖了,就是贪 ,
主要原理 a < b < c _____ c - a = b -a + c - b;
class Solution {
public int maxProfit(int[] prices) {
int profit = 0;
for (int i = 1; i < prices.length; i++) {
if (prices[i] > prices[i - 1]) {
profit += (prices[i] - prices[i - 1]);
}
}
return profit;
}
}