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].
2. Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer.

题意：求数组三个数之积最大的那个值。

java代码：

class Solution {
    public int maximumProduct(int[] nums) {
        Arrays.sort(nums);
        int n=nums.length;
        int p1=nums[0]*nums[1]*nums[n-1];
        int p2=nums[n-3]*nums[n-2]*nums[n-1];
        if(nums[0]<0&&nums[1]<0) 
        {
            if (nums[0] * nums[1] * nums[n - 1] < nums[n - 3] * nums[n - 2] * nums[n - 1])
                return p2;
            else
                return p1;
        }
        else 
            return p2;
    }
}