package leetcode;

/**
 * https://leetcode.com/problems/maximum-product-of-three-numbers/
 */
public class Problem628 {
    public int maximumProduct(int[] nums) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem628 prob = new Problem628();
        System.out.println(prob.maximumProduct(new int[]{1, 2, 3})); // 6
        System.out.println(prob.maximumProduct(new int[]{1, 2, 3, 4})); // 24
    }
}

@@ -439,16 +439,103 @@
 ; // 24%0A
+        System.out.println(prob.maximumProduct(new int%5B%5D%7B-4, -3, -2, -1, 60%7D)); // 720%0A
     %7D%0A%7D%0A

Update problem 628