Best Time to Buy/Sell Stock I — Single Transaction

class Solution:
    def maxProfit(self, prices: list[int]) -> int:
        min_p=float('inf'); best=0
        for p in prices:
            min_p=min(min_p,p); best=max(best,p-min_p)
        return best

class Solution {
public:
    int maxProfit(vector<int>& p){
        int mn=INT_MAX,best=0;
        for(int x:p){mn=min(mn,x);best=max(best,x-mn);}
        return best;
    }
};

class Solution {
    public int maxProfit(int[] p){
        int mn=Integer.MAX_VALUE,best=0;
        for(int x:p){mn=Math.min(mn,x);best=Math.max(best,x-mn);}
        return best;
    }
}