Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 2309da6

Browse files
Create Code : Print Intersection
1 parent b94acea commit 2309da6

File tree

1 file changed

+28
-0
lines changed

1 file changed

+28
-0
lines changed

‎Hashmaps/Code : Print Intersection

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
#include<unordered_map>
2+
3+
void printIntersection(int arr1[], int arr2[], int n, int m) {
4+
if(n>m){
5+
unordered_map<int,int> elementsofarray1;
6+
for(int i=0;i<n;i++){
7+
elementsofarray1[arr1[i]]++;
8+
}
9+
for(int i=0;i<m;i++){
10+
if(elementsofarray1[arr2[i]]>0){
11+
cout<<arr2[i]<<endl;
12+
elementsofarray1[arr2[i]]--;
13+
}
14+
}
15+
}
16+
else{
17+
unordered_map<int,int> elementsofarray2;
18+
for(int i=0;i<m;i++){
19+
elementsofarray2[arr2[i]]++;
20+
}
21+
for(int i=0;i<n;i++){
22+
if(elementsofarray2[arr1[i]]>0){
23+
cout<<arr1[i]<<endl;
24+
elementsofarray2[arr1[i]]--;
25+
}
26+
}
27+
}
28+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /