买卖股票的最好时机(一)

public int maxProfit (int[] prices) {
        // write code here

        int max=0;
        int minp=prices[0];
        for (int i=0;i<prices.length;i++){

            if(minp>prices[i]){
                minp=prices[i];
            }else if(max<prices[i]-minp){
                max=prices[i]-minp;
            }

        }

        return max;
    }