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