Easy
You are given an integer array nums.
Choose exactly one pair of distinct indices i and j. The strength of the pair is defined as (nums[i] * nums[j]) / gcd(nums[i], nums[j])2.
Return the maximum strength over all possible pairs.
Example 1:
Input: nums = [2,3,5]
Output: 15
Explanation:
Choosing i = 1 and j = 2 gives strength (3 * 5) / gcd(3, 5)2 = 15 / 1 = 15, which is the maximum over all pairs.
Example 2:
Input: nums = [4,6,8]
Output: 12
Explanation:
Choosing i = 1 and j = 2 gives strength (6 * 8) / gcd(6, 8)2 = 48 / 4 = 12, which is the maximum over all pairs.
Example 3:
Input: nums = [3,3]
Output: 1
Explanation:
Choosing i = 0 and j = 1 gives strength (3 * 3) / gcd(3, 3)2 = 9 / 9 = 1, the maximum over all pairs.
Constraints:
2 <= nums.length <= 20001 <= nums[i] <= 105import java.util.Arrays;
@SuppressWarnings("java:S135")
public class Solution {
private int gcd(int n, int m) {
while (m != 0) {
int remainder = n % m;
n = m;
m = remainder;
}
return n;
}
public long maxPairStrength(int[] nums) {
long maxStrength = 0;
int end = nums.length - 1;
Arrays.sort(nums);
for (int i = end; i > 0; i--) {
for (int j = i - 1; j >= 0; j--) {
long product = (long) nums[i] * nums[j];
if (product <= maxStrength) {
break;
}
int hcf = gcd(nums[i], nums[j]);
if (hcf == 0) {
continue;
}
long currentStrength = (long) (nums[i] / hcf) * (nums[j] / hcf);
if (currentStrength > maxStrength) {
maxStrength = currentStrength;
}
}
}
return maxStrength;
}
}