mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
34 lines
1.3 KiB
HTML
34 lines
1.3 KiB
HTML
|
<p>Given an array <code>nums</code> of <strong>distinct</strong> positive integers, return <em>the number of tuples </em><code>(a, b, c, d)</code><em> such that </em><code>a * b = c * d</code><em> where </em><code>a</code><em>, </em><code>b</code><em>, </em><code>c</code><em>, and </em><code>d</code><em> are elements of </em><code>nums</code><em>, and </em><code>a != b != c != d</code><em>.</em></p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [2,3,4,6]
|
||
|
|
<strong>Output:</strong> 8
|
||
|
|
<strong>Explanation:</strong> 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)
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [1,2,4,5,10]
|
||
|
|
<strong>Output:</strong> 16
|
||
|
|
<strong>Explanation:</strong> 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)
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= nums.length <= 1000</code></li>
|
||
|
|
<li><code>1 <= nums[i] <= 10<sup>4</sup></code></li>
|
||
|
|
<li>All elements in <code>nums</code> are <strong>distinct</strong>.</li>
|
||
|
|
</ul>
|