int maxProfit(vector<int>& prices) {
int n = prices.size();
int sum = 0;
for (int i = 0; i < n - 1; i++) {
if (prices[i + 1] > prices[i]) {
sum += (prices[i + 1] - prices[i]);
}
}
return sum;
}
leetcode刷题笔记 122.买股票的最佳时机 II【简单】
最新推荐文章于 2022-07-12 20:17:42 发布