class Solution {public: int maxProfit(vector<int>& prices) { int k=0;
if(prices.empty())
return 0;
for(int i=1;i<prices.size();i++)
{
if(prices[i-1]<prices[i])
{
k=k+prices[i]-prices[i-1];
}
}
return k;
}
};
122
最新推荐文章于 2024-02-25 16:38:24 发布