Leetcode

628. Maximum Product of Three Numbers

by hooni posted May 05, 2020
?

단축키

Prev이전 문서

Next다음 문서

ESC닫기

크게 작게 위로 아래로 댓글로 가기 인쇄

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 s1 = nums[0] * nums[1] * nums[nums.length-1];
        int s2 = nums[0] * nums[nums.length-1] * nums[nums.length-2];
        int s3 = nums[nums.length-1] * nums[nums.length-2] * nums[nums.length-3];
        
        return Math.max(Math.max(s1, s2), s3);
    }
}

[문제] https://leetcode.com/problems/maximum-product-of-three-numbers/