628. Maximum Product of Three Numbers

import java.util.Arrays;

/**
 * Created by Joe on 2018/3/17.
 * 628. Maximum Product of Three Numbers
 * https://leetcode.com/problems/maximum-product-of-three-numbers/description/
 */
public class P628 {
    public int maximumProduct(int[] nums) {

        Arrays.sort(nums);

        int a = nums[nums.length - 1] * nums[nums.length - 2] * nums[nums.length - 3];
        int b = nums[0] * nums[1] * nums[nums.length - 1];
        return a > b ? a : b;
    }
}

刚开始做题排序直接就返回后三个值乘积。得到WA看到测试用例之后才发现有坑。。。
还是细心一点。。。不过说实话。。刚开始是真的想不到

Input: [-4,-3,-2,-1,60]
Output: 120
Expected: 720