leetcode628. Maximum Product of Three Numbers

最新推荐文章于 2020-09-24 22:58:54 发布

大大kc

最新推荐文章于 2020-09-24 22:58:54 发布

阅读量1.2k

点赞数 1

分类专栏： leetcode 文章标签： leetcode array

本文链接：https://blog.csdn.net/rxt2012kc/article/details/73719344

版权

leetcode 同时被 2 个专栏收录

187 篇文章 0 订阅

订阅专栏

算法-Array

15 篇文章 0 订阅

订阅专栏

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:
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) {
        if (nums == null || nums.length == 0) {
            return 0;
        }

        Arrays.sort(nums);
        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;
    }
}