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