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

题意：三个数乘积最大

三个数乘积最大，一定有最大的那个数，其次有两个积为最大的数，两个最小或者两个次大的

投机取巧的方法，排序之后直接判断

class Solution {
    public int maximumProduct(int[] nums) {
        Arrays.sort(nums);
        int n = nums.length - 1;
        int res1 = nums[n - 2] * nums[n - 1];
        int res2 = nums[0] * nums[1];
        return nums[n] * Math.max(res1, res2);
    }
}

 

 

转载于:https://www.cnblogs.com/Moriarty-cx/p/9763309.html