121. Best Time to Buy and Sell Stock

#code


class Solution {
public:
    int maxProfit(vector<int>& p) {
        int maxp = 0;
        int minp = INT_MAX;
        
        for(int i=0;i<p.size();i++){
            if(p[i] < minp)
                minp = p[i];
            if(p[i] - minp > maxp)
                maxp = p[i] - minp;
        }
        return maxp;
    }
};