@@ -0,0 +1,340 @@
+import java.util.Arrays;%0A%0Apublic class Solution %7B%0A%0A    public int maximumProduct(int%5B%5D nums) %7B%0A%0A        Arrays.sort(nums);%0A%0A        int pattern1 = nums%5Bnums.length - 1%5D * nums%5Bnums.length - 2%5D * nums%5Bnums.length - 3%5D;%0A        int pattern2 = nums%5B0%5D * nums%5B1%5D * nums%5Bnums.length - 1%5D;%0A%0A        return Math.max(pattern1, pattern2);%0A%0A    %7D%0A%0A%7D%0A

Create : 628 Maximum Product of Three Numbers