forked from haoel/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
New Problem Solution - "1726. Tuple with Same Product"
- Loading branch information
Showing
2 changed files
with
62 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
61 changes: 61 additions & 0 deletions
61
algorithms/cpp/tupleWithSameProduct/TupleWithSameProduct.cpp
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,61 @@ | ||
// Source : https://leetcode.com/problems/tuple-with-same-product/ | ||
// Author : Hao Chen | ||
// Date : 2021-04-27 | ||
|
||
/***************************************************************************************************** | ||
* | ||
* Given an array nums of distinct positive integers, return the number of tuples (a, b, c, d) such | ||
* that a * b = c * d where a, b, c, and d are elements of nums, and a != 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 valids 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,4,5) | ||
* (4,5,2,10) , (4,5,10,2) , (5,4,2,10) , (5,4,10,2) | ||
* | ||
* Example 3: | ||
* | ||
* Input: nums = [2,3,4,6,8,12] | ||
* Output: 40 | ||
* | ||
* Example 4: | ||
* | ||
* Input: nums = [2,3,5,7] | ||
* Output: 0 | ||
* | ||
* Constraints: | ||
* | ||
* 1 <= nums.length <= 1000 | ||
* 1 <= nums[i] <= 10^4 | ||
* All elements in nums are distinct. | ||
******************************************************************************************************/ | ||
|
||
class Solution { | ||
public: | ||
int tupleSameProduct(vector<int>& nums) { | ||
unordered_map<int, int> stat; | ||
for(int i = 0; i < nums.size(); i++) { | ||
for ( int j = i+1; j < nums.size(); j++) { | ||
stat[nums[i]*nums[j]]++; | ||
} | ||
} | ||
|
||
int result = 0; | ||
for ( auto [n, cnt] : stat) { | ||
if (cnt > 1) result += cnt*2 * (cnt-1)*2; | ||
} | ||
return result; | ||
} | ||
}; |