Java: Get the portion of this map whose keys are less than a given key

Last update on December 21 2024 09:36:34 (UTC/GMT +8 hours)

Write a Java program to get the portion of this map whose keys are less than (or equal to, if inclusive is true) a given key.

Sample Solution:-

Java Code:

import java.util.*;
import java.util.Map.Entry;  
public class Example14 {  
       public static void main(String args[]) {

  // Create a tree map
  TreeMap < Integer, String > tree_map1 = new TreeMap < Integer, String > ();

  // Put elements to the map 
  tree_map1.put(10, "Red");
  tree_map1.put(20, "Green");
  tree_map1.put(40, "Black");
  tree_map1.put(50, "White");
  tree_map1.put(60, "Pink");

  System.out.println("Orginal TreeMap content: " + tree_map1);
  System.out.println("Checking the entry for 10: ");
  System.out.println("Key(s): " + tree_map1.headMap(10, true));
  System.out.println("Checking the entry for 20: ");
  System.out.println("Key(s): " + tree_map1.headMap(20, true));
  System.out.println("Checking the entry for 70: ");
  System.out.println("Key(s): " + tree_map1.headMap(70, true));
 }
}

Sample Output:

Orginal TreeMap content: {10=Red, 20=Green, 40=Black, 50=White, 60=Pink
}                                                                      
Checking the entry for 10:                                             
Key(s): {10=Red}                                                       
Checking the entry for 20:                                             
Key(s): {10=Red, 20=Green}                                             
Checking the entry for 70:                                             
Key(s): {10=Red, 20=Green, 40=Black, 50=White, 60=Pink}

Java Code Editor:

Contribute your code and comments through Disqus.

Previous: Get the portion of a map whose keys are strictly less than a given key.
Next: Get the least key strictly greater than the given key.