122. 买卖股票的最佳时机 II
简单的贪心
class Solution {
public:
int maxProfit(vector<int> &prices) {
int res = 0;
if(prices.size()==0)
return res;
for (int i = 0; i < prices.size() - 1; i++) {
int t = prices[i + 1] - prices[i];
if (t > 0)
res += t;
}
return res;
}
};
