Force deduction 121 questions

class Solution 
{
    
public:
    int maxProfit(vector<int>& prices) 
    {
    
        if(prices.empty())
            return 0;
        // Direct use of a loop , Find the lowest price to buy , And find the maximum profit under this buying price 
        int profit  = 0;
        int min = prices[0];
        for(int i = 1; i < prices.size(); i++)
        {
    
            if(min > prices[i])
                min = prices[i];
            else
                profit = max(profit, prices[i] - min);
        }
        return profit;
        
    }
};