[LeetCode]628. Maximum Product of Three Numbers

最新推荐文章于 2023-12-26 13:13:16 发布

Ellie_

最新推荐文章于 2023-12-26 13:13:16 发布

阅读量342

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/Ellie_/article/details/76596024

版权

LeetCode 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

排序过后，依次讨论前三个，后三个，以及后两个跟第一个，前两个跟最后一个。注意负数！！

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 class Solution {
    public int maximumProduct(int[] nums) {
        Arrays.sort(nums);
        int max, n;
        n=nums.length;
        max=nums[0]*nums[1]*nums[2];
        max=Math.max(max,nums[n-3]*nums[n-2]*nums[n-1]);
        max=Math.max(max,nums[0]*nums[1]*nums[n-1]);
        max=Math.max(max,nums[0]*nums[n-1]*nums[n-2]);
        
        return max;
    }
}