class Solution {
    public int maxProfit(int[] prices) {
        int minimum=Integer.MAX_VALUE;
        int maxprofit=0;
        for(int i=0;imaxprofit)    maxprofit=prices[i]-minimum;
        }
        return maxprofit;
        
    }
}