Check if a key is present in a C++ map or unordered_map
A C++ map and unordered_map are initialized to some keys and their respective mapped values.
Examples:
Input :
Map : 1 -> 4, 2 -> 6, 4 -> 6
Check1 : 5, Check2 : 4
Output : 5 : Not present, 4 : Present
C++ implementation :
map
#include <bits/stdc++.h>
using namespace std;
string check_key(unordered_map< int , int > m, int key)
{
if (m.find(key) == m.end())
return "Not Present" ;
return "Present" ;
}
int main()
{
unordered_map< int , int > m;
m[1] = 4;
m[2] = 6;
m[4] = 6;
int check1 = 5, check2 = 4;
cout << check1 << ": " << check_key(m, check1) << '\n' ;
cout << check2 << ": " << check_key(m, check2);
}
|
unordered_map
#include <bits/stdc++.h>
using namespace std;
string check_key(map< int , int > m, int key)
{
if (m.count(key) == 0)
return "Not Present" ;
return "Present" ;
}
int main()
{
map< int , int > m;
m[1] = 4;
m[2] = 6;
m[4] = 6;
int check1 = 5, check2 = 4;
cout << check1 << ": " << check_key(m, check1) << '\n' ;
cout << check2 << ": " << check_key(m, check2);
}
|
Output:
5: Not Present
4: Present
Approach 2nd:
we can also use the count function of the map in c++.
Implementation:
1. Map
C++
#include <bits/stdc++.h>
using namespace std;
string check_key(unordered_map< int , int > m, int key)
{
if (m.count(key) == 0)
return "Not Present" ;
return "Present" ;
}
int main()
{
unordered_map< int , int > m;
m[1] = 4;
m[2] = 6;
m[4] = 6;
int check1 = 5, check2 = 4;
cout << check1 << ": " << check_key(m, check1) << '\n' ;
cout << check2 << ": " << check_key(m, check2);
}
|
Output:
5: Not Present
4: Present
2. Unordered Map
Output:
5: Not Present
4: Present
Last Updated :
11 Oct, 2021
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...