leetcode628.三个数的最大乘积

class Solution {
    public int maximumProduct(int[] nums) {
    	//进行自动装箱
        Integer[] arr = new Integer[nums.length];
        for (int i = 0; i < nums.length; i++) arr[i] = nums[i];
        //Collections.reverseOrder() Java带有的降序排序函数
        Arrays.sort(arr, Collections.reverseOrder());
        int a = arr[0] * arr[1] * arr[2];
        int b = arr[0] * arr[nums.length - 1] * arr[nums.length - 2];
        return Math.max(a,b);
    }
}