O(n) solution for how to Quickly find maximum-product-difference-between-two-pairs
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int maxProductDifference(int[] nums) {\n         int len=nums.length;\n   Arrays.sort(nums);\n   int max=nums[len-1]*nums[len-2];\n   int min=nums[0]*nums[1];\nint diff=max-min;\nreturn diff;\n    }\n}\n```
['Java']