class Solution {
public:
int maxProfit(vector<int>& prices) {
int n=prices.size();
int preMin=prices[0];
int res=0;
for(int i=1;i<n;++i){
if(prices[i]>preMin){
res=max(res,prices[i]-preMin);
}
else{
preMin=prices[i];
}
}
return res;
}
};
leetcode前缀最小值
最新推荐文章于 2024-08-02 20:41:30 发布