Beli dan jual stok

class Solution {
    public int maxProfit(int[] prices) {
        int minimum=Integer.MAX_VALUE;
        int maxprofit=0;
        for(int i=0;i<prices.length;i++){
            if(prices[i]<minimum) minimum=prices[i];
            else if(prices[i]-minimum>maxprofit)    maxprofit=prices[i]-minimum;
        }
        return maxprofit;
        
    }
}
Lucky Lapwing