Leetcode：628. Maximum Product of Three Numbers

原创于 2017-11-12 11:48:59 发布 · 280 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #numbers

leetcode 同时被 2 个专栏收录

47 篇文章

订阅专栏

Leetcode

47 篇文章

订阅专栏

本文介绍了一种算法，该算法能在给定整数数组中找到三个数，使得这三个数的乘积最大，并返回这个最大乘积。通过排序数组并考虑最大与最小值的影响，该算法能在有效时间内解决问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:
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 static int maximumProduct(int[] nums) {
        Arrays.sort(nums);
        //-1 0 1 2 3
        //-2 -1 0 2 3 4
        //-3 -2 -1 1 2 3
        //-4 -3 -2 -1  0
        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;
    }