Leetcode
2020.05.05 09:13
628. Maximum Product of Three Numbers
조회 수 797 추천 수 0 댓글 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.
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/
