class Solution {
public:
int maxProfit(vector<int> &prices) {
if(prices.empty()){
return 0;
}
int cur_min=prices[0],cur_pro=0;
for(int i=1;i<prices.size();i++){
if(prices[i]<cur_min){
cur_min=prices[i];
}
else if(prices[i]-cur_min>cur_pro){
cur_pro=prices[i]-cur_min;
}
}
return cur_pro;
}
};
LeetCode - 121 Best Time to Buy and Sell Stock
最新推荐文章于 2024-06-16 20:21:50 发布