双指针
class Solution {
public:
int maxProfit(vector<int>& prices) {
if(prices.empty())return 0;
int n=prices.size();
if(n==1)return 0;
int min_n=prices[0];
int max_n=prices[0];
int out=0;
for(int i=1;i<n;i++){
if(prices[i]>max_n)max_n=prices[i];
out=max(out,max_n-min_n);
if(prices[i]<min_n){
min_n=prices[i];
max_n=prices[i];
}
}
return out;
}
};