LeetCode 628.Maximum Product of Three Numbers

Given an integer array, find three numbers whose product is maximum and output the maximum product.

Example 1:

Input: [1,2,3]
Output: 6

 

Example 2:

Input: [1,2,3,4]
Output: 24

 

Note:

1. The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000].

 

1. Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer.

LeetCode第628题，找出三数所能计算到的最大值，本人所写代码如下：

class Solution {
    public int maximumProduct(int[] nums) {
        Arrays.sort(nums);
        int max = 0;
        int length = nums.length;
        int one = nums[length - 1] * nums[length - 2] * nums[length - 3];
        int two = nums[0] * nums[1] * nums[length - 1];
        if (nums[0] < 0 && nums[1] < 0) {
            max = one > two ? one :two;
        } else {
            max = one;
        }
        return max;
    }
}

如有更优方法，欢迎交流。