Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

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

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.