Skip to content

Commit 15ca943

Browse files
authored
Merge pull request #1 from phdtrong/phdtrong-patch-1
Create Conditional Triplet.cpp for a Leetcode problem sastava007#21
2 parents 850d11e + a420a7f commit 15ca943

File tree

1 file changed

+32
-0
lines changed

1 file changed

+32
-0
lines changed

Diff for: Leetcode/Misclenaous/ConditionalTriplets

+32
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
class Solution {
2+
public:
3+
int numTriplets(vector<int>& nums1, vector<int>& nums2) {
4+
//result of the function
5+
int resultOfTriplet = 0;
6+
7+
//Count type 1
8+
for(unsigned int i=0; i < nums1.size(); i++){
9+
for(unsigned int j=0; j < nums2.size(); j++){
10+
for(unsigned int k=j+1; k < nums2.size(); k++){
11+
if((nums1[i]*nums1[i]) == nums2[j]*nums2[k]){
12+
resultOfTriplet++;
13+
}
14+
}
15+
}
16+
}
17+
18+
//Count type 2
19+
for(int i=0; i < nums2.size(); i++){
20+
for(int j=0; j < nums1.size(); j++){
21+
for(int k=j+1; k < nums1.size(); k++){
22+
if((nums2[i]*nums2[i]) == nums1[j]*nums1[k]){
23+
resultOfTriplet++;
24+
}
25+
}
26+
}
27+
}
28+
29+
//Return result after working
30+
return resultOfTriplet;
31+
}
32+
};

0 commit comments

Comments
 (0)