leetcode628. Maximum Product of Three Numbers

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: 6Example 2:Input: [1,2,3,4]Output: 24

Note:
The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000].
Multiplication of any three numbers in the input won’t exceed the range of 32-bit signed integer.

解法

public class Solution {    public int maximumProduct(int[] nums) {        if (nums == null || nums.length == 0) {            return 0;        }        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;    }}