Advertisement
1726. Tuple with Same Product
MediumView on LeetCode
Time: O(n²)
Space: O(n²)
Approach
Count all pairwise products in a HashMap; each duplicate pair yields 8 tuples.
1726.cs
C#
// Approach: Count all pairwise products in a HashMap; each duplicate pair yields 8 tuples.
// Time: O(n²) Space: O(n²)
public class Solution
{
public int TupleSameProduct(int[] nums)
{
int ans = 0;
Dictionary<int, int> count = new Dictionary<int, int>();
for (int i = 0; i < nums.Length; ++i)
{
for (int j = 0; j < i; ++j)
{
int prod = nums[i] * nums[j];
ans += count.GetValueOrDefault(prod, 0) * 8;
if (count.ContainsKey(prod))
count[prod]++;
else
count[prod] = 1;
}
}
return ans;
}
}Advertisement
Was this solution helpful?