leetcode 628. Maximum Product of Three Numbers | 628. 三个数的最大乘积（Java）

梦里梦外; 2022-10-18 00:59 200阅读 0赞

## 题目 ##

[https://leetcode-cn.com/problems/maximum-product-of-three-numbers/][https_leetcode-cn.com_problems_maximum-product-of-three-numbers]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70]

## 题解 ##

找到三个数的最大乘积。先给数组排序，考虑可能有负数的情况，最大的乘积只有两种组合方式：  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_1_color_FFFFFF_t_70]

class Solution { 
        public int maximumProduct(int[] nums) { 
            Arrays.sort(nums);
            int len = nums.length;
            int n1 = nums[0] * nums[1] * nums[len - 1];
            int n2 = nums[len - 1] * nums[len - 2] * nums[len - 3];
            return Math.max(n1, n2);
        }
    }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70 1]

[https_leetcode-cn.com_problems_maximum-product-of-three-numbers]: https://leetcode-cn.com/problems/maximum-product-of-three-numbers/
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70]: /images/20221014/c6da5a906b2a4763a7a55b779264d31f.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_1_color_FFFFFF_t_70]: /images/20221014/2b98e180cb07495e9c662fe9451bd4be.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70 1]: /images/20221014/751a2ca9c8cb4b3196da3158f6a063d1.png