-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCommon_elements.cpp
More file actions
86 lines (76 loc) · 2.07 KB
/
Common_elements.cpp
File metadata and controls
86 lines (76 loc) · 2.07 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
class Solution
{
public:
vector <int> commonElements (int A[], int B[], int C[], int n1, int n2, int n3)
{
vector<int>ans;
int i=0,j=0,k=0;
while(i<n1&&j<n2&&k<n3)
{
if(A[i]<B[j]&&A[i]<C[k])
{
i++;
}
else if(A[i]<=B[j]&&A[i]<C[k])
{
i++;
}
else if(A[i]<B[j]&&A[i]<=C[k])
{
i++;
}
else if(B[j]<A[i]&&B[j]<C[k])
{
j++;
}
else if(B[j]<=A[i]&&B[j]<C[k])
{
j++;
}
else if(B[j]<A[i]&&B[j]<=C[k])
{
j++;
}
else if(C[k]<A[i]&&C[k]<B[j])
{
k++;
}
else if(C[k]<=A[i]&&C[k]<B[j])
{
k++;
}
else if(C[k]<A[i]&&C[k]<=B[j])
{
k++;
}
else if(A[i]==B[j]&&B[j]==C[k])
{ ans.push_back(A[i]);
i++;
}
}
ans.erase(unique(ans.begin(),ans.end()),ans.end());
return ans;
}
};
int main ()
{
int t; cin >> t;
while (t--)
{
int n1, n2, n3;
cin >> n1 >> n2 >> n3;
int A[n1];
int B[n2];
int C[n3];
for (int i = 0; i < n1; i++) cin >> A[i];
for (int i = 0; i < n2; i++) cin >> B[i];
for (int i = 0; i < n3; i++) cin >> C[i];
Solution ob;
vector <int> res = ob.commonElements (A, B, C, n1, n2, n3);
if (res.size () == 0)
cout << -1;
for (int i = 0; i < res.size (); i++)
cout << res[i] << " ";
cout << endl;
}
}