Maximum Product Difference Between Two Pairs

….太水了

class Solution {
    public int maxProductDifference(int[] nums) {
        int n = nums.length;
        Arrays.sort(nums);
        return (nums[n - 1] * nums[n - 2]  - (nums[0] * nums[1]));
    }
}