public class Solution {
public int maxProfit(int[] prices) {
int sum = 0;
for (int i = 0; i < prices.length - 1; i++) {
if (prices[i + 1] > prices[i]) sum += prices[i + 1] - prices[i];
}
return sum;
}
}
LeetCode 122. Best Time to Buy and Sell Stock II
最新推荐文章于 2024-09-18 11:04:20 发布