力扣_121. 买卖股票的最/ppp佳/时/机

class Solution {
public:
    int maxProfit(vector<int>& prices) {
       int a=10000;
       int b=0;
       int l=0;
       for(int i=0;i<prices.size();i++)
       {
           if(prices[i]<a)
           {a=prices[i];
           b=0;}
           if(prices[i]>b)
           {b=prices[i];}
           if((b-a)>l)
           {l=b-a;}
       }
       return l;
    }
};