Class Solution
-
- All Implemented Interfaces:
public final class Solution
1726 - Tuple with Same Product\.
Medium
Given an array
nums
of distinct positive integers, return the number of tuples(a, b, c, d)
such thata * b = c * d
wherea
,b
,c
, andd
are elements ofnums
, anda != b != c != d
.Example 1:
Input: nums = 2,3,4,6
Output: 8
Explanation: There are 8 valid tuples:
(2,6,3,4) , (2,6,4,3) , (6,2,3,4) , (6,2,4,3)
(3,4,2,6) , (4,3,2,6) , (3,4,6,2) , (4,3,6,2)
Example 2:
Input: nums = 1,2,4,5,10
Output: 16
Explanation: There are 16 valid tuples:
(1,10,2,5) , (1,10,5,2) , (10,1,2,5) , (10,1,5,2)
(2,5,1,10) , (2,5,10,1) , (5,2,1,10) , (5,2,10,1)
(2,10,4,5) , (2,10,5,4) , (10,2,4,5) , (10,2,5,4)
(4,5,2,10) , (4,5,10,2) , (5,4,2,10) , (5,4,10,2)
Constraints:
1 <= nums.length <= 1000
<code>1 <= numsi<= 10<sup>4</sup></code>
All elements in
nums
are distinct.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final Integer
tupleSameProduct(IntArray nums)
-
-
Method Detail
-
tupleSameProduct
final Integer tupleSameProduct(IntArray nums)
-
-
-
-