题解 | #买卖股票的最好时机#

import java.util.*;


public class Solution {
    /**
     * 
     * @param prices int整型一维数组 
     * @return int整型
     */
    public int maxProfit (int[] prices) {

        if(prices.length == 0 || prices == null)
            return 0;

         int min = prices[0];
        int max =0;
        // write code here

        for(int i=0;i< prices.length;i++){
            min = Math.min(min,prices[i]);
            max = Math.max(max,prices[i] - min);
        }
        return max;
    }
}