Java Easy  using sorting
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 maximumProduct(int[] nums) {\n        Arrays.sort(nums);\n         //One of the Three Numbers is the maximum value in the array.\n\n         int a = nums[nums.length - 1] * nums[nums.length - 2] * nums[nums.length - 3];\n         int b = nums[0] * nums[1] * nums[nums.length - 1];\n         return a > b ? a : b;\n    }\n}\n```
['Java']