class Solution { public: int maxProfit(vector<int>& prices) { if(prices.empty()){ return 0; } int minpri=prices[0]; int prof=0; for(int i=0;i<prices.size();i++){ if(prices[i]<minpri){ minpri=prices[i]; } if(prices[i]-minpri>prof){ prof=prices[i]-minpri; } } return prof; } };
leetcode 121 买卖股票的最佳时机 (Best Time to Buy and Sell Stock)
猜你喜欢
转载自www.cnblogs.com/azureice/p/leetcode121.html
今日推荐
周排行