class Solution {
public:
int maxProfit(vector<int>& prices) {
int sum=0;
for(int i=1;i<prices.size();i++)
{
int diff=prices[i]-prices[i-1];
if(diff>0)
sum+=diff;
}
return sum;
}
};
LeetCode 121 Best Time to Buy and Sell Stock II 买卖股票的最佳时机 II
猜你喜欢
转载自blog.csdn.net/qq_34501451/article/details/83176238
今日推荐
周排行