class Solution {
public:
int maxProfit(vector<int>& prices) {
int sum = 0;
for(int i = 0; i < prices.size() - 1; i++){
if(prices[i] < prices[i + 1])
sum += prices[i + 1] - prices[i];
}
return sum;
}
};
买卖股票的最佳时机II
最新推荐文章于 2024-05-08 22:04:44 发布