JAVA_Maximum Product of Three Numbers_LeetCode 628

JAVA_Maximum Product of Three Numbers_LeetCode 628 풀이 class Solution { public int maximumProduct(int[] nums) { Arrays.sort(nums); int n = nums.length; return Math.max(nums[n-1] * nums[n-2] * nums[n-3] , nums[0] * nums[1] * nums[n-1]); } } * 출처 Maximum Product of Three Numbers - LeetCode Maximum Product of Three Numbers - Given an integer array nums, find three numbers whose product is maximum and return the maximum product. Example 1: Input: nums = [1,2,3] Output: 6 Example 2: Input: nums = [1,2...

원문링크 : JAVA_Maximum Product of Three Numbers_LeetCode 628