Given a HashMap and a key in Java, the task is to check if this key exists in the HashMap or not.
Examples:
Input: HashMap: {1=Geeks, 2=ForGeeks, 3=GeeksForGeeks}, key = 2
Output: true
Input: HashMap: {1=G, 2=e, 3=e, 4=k, 5=s}, key = 10
Output: false
- Using Iterator (Not Efficient):
- Get the HashMap and the Key
- Create an iterator to iterate over the HashMap using HashMap.iterate() method.
- Iterate over the HashMap using the Iterator.hasNext() method.
- While iterating, check for the key at that iteration to be equal to the key specified. The entry key of the Map can be obtained with the help of entry.getKey() method.
- If the key matches, set the flag as true.
- The flag value after iterating, contains the result.
Below is the implementation of the above approach:
Program 1:
// Java program to check if a key exists// in a HashMap or notÂÂimportjava.util.*;ÂÂpublicclassGFG {   Âpublicstaticvoidmain(String[] args)   Â{       Â// Create a HashMap       ÂHashMap<Integer, String>           Âmap =newHashMap<>();       Â// Populate the HashMap       Âmap.put(1,"Geeks");       Âmap.put(2,"ForGeeks");       Âmap.put(3,"GeeksForGeeks");       Â// Get the key to be removed       ÂintkeyToBeChecked =2;       Â// Print the initial HashMap       ÂSystem.out.println("HashMap: "                          Â+ map);       Â// Get the iterator over the HashMap       ÂIterator<Map.Entry<Integer, String> >           Âiterator = map.entrySet().iterator();       Â// flag to store result       ÂbooleanisKeyPresent =false;       Â// Iterate over the HashMap       Âwhile(iterator.hasNext()) {           Â// Get the entry at this iteration           ÂMap.Entry<Integer, String>               Âentry               Â= iterator.next();           Â// Check if this key is the required key           Âif(keyToBeChecked == entry.getKey()) {               ÂisKeyPresent =true;           Â}       Â}       Â// Print the result       ÂSystem.out.println("Does key "                          Â+ keyToBeChecked                          Â+" exists: "                          Â+ isKeyPresent);   Â}}Output:HashMap: {1=Geeks, 2=ForGeeks, 3=GeeksForGeeks} Does key 2 exists: trueProgram 2: To show why this method is not suggested. If the HashMap contains null values, then this method will throw NullPointerException. This makes this method a non suggestable method to use.
// Java program to check if a key exists// in a HashMap or notÂÂimportjava.util.*;ÂÂpublicclassGFG {   Âpublicstaticvoidmain(String[] args)   Â{       Âtry{           Â// Create a HashMap           ÂHashMap<Integer, String>               Âmap =newHashMap<>();           Â// Populate the HashMap           Âmap.put(1,"Geeks");           Âmap.put(2,"ForGeeks");           Âmap.put(null,"GeeksForGeeks");           Â// Get the key to be removed           ÂintkeyToBeChecked =2;           Â// Print the initial HashMap           ÂSystem.out.println("HashMap: "                              Â+ map);           Â// Get the iterator over the HashMap           ÂIterator<Map.Entry<Integer, String> >               Âiterator = map.entrySet().iterator();           Â// flag to store result           ÂbooleanisKeyPresent =false;           Â// Iterate over the HashMap           Âwhile(iterator.hasNext()) {               Â// Get the entry at this iteration               ÂMap.Entry<Integer, String>                   Âentry                   Â= iterator.next();               Â// Check if this key is the required key               Âif(keyToBeChecked == entry.getKey()) {                   ÂisKeyPresent =true;               Â}           Â}           Â// Print the result           ÂSystem.out.println("Does key "                              Â+ keyToBeChecked                              Â+" exists: "                              Â+ isKeyPresent);       Â}       Âcatch(Exception e) {           ÂSystem.out.println(e);       Â}   Â}}Output:HashMap: {null=GeeksForGeeks, 1=Geeks, 2=ForGeeks} java.lang.NullPointerException - Using HashMap.containsKey method(Efficient):
- Get the HashMap and the Key
- Check if the key exists in the HashMap or not using HashMap.containsKey() method. If the key exists, set the flag as true.
- The flag value, contains the result.
Below is the implementation of the above approach:
Program 1:
// Java program to check if a key exists// in a HashMap or notÂÂimportjava.util.*;ÂÂpublicclassGFG {   Âpublicstaticvoidmain(String[] args)   Â{       Â// Create a HashMap       ÂHashMap<Integer, String>           Âmap =newHashMap<>();       Â// Populate the HashMap       Âmap.put(1,"Geeks");       Âmap.put(2,"ForGeeks");       Âmap.put(null,"GeeksForGeeks");       Â// Get the key to be removed       ÂintkeyToBeChecked =2;       Â// Print the initial HashMap       ÂSystem.out.println("HashMap: "                          Â+ map);       Â// Check is key exists in the Map       ÂbooleanisKeyPresent = map.containsKey(keyToBeChecked);       Â// Print the result       ÂSystem.out.println("Does key "                          Â+ keyToBeChecked                          Â+" exists: "                          Â+ isKeyPresent);   Â}}Output:HashMap: {null=GeeksForGeeks, 1=Geeks, 2=ForGeeks} Does key 2 exists: true
