Java: Get a key-value mapping associated with the greatest key less than or equal to the given key

Java Collection, TreeMap Exercises: Exercise-11 with Solution

Write a Java program to get a key-value mapping associated with the greatest key less than or equal to the given key.

Sample Solution:-

Java Code:

import java.util.*;
import java.util.Map.Entry;  
public class Example11 {  
     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("Value is: " + tree_map1.floorEntry(10));
  System.out.println("Checking the entry for 30: ");
  System.out.println("Value is: " + tree_map1.floorEntry(30));
  System.out.println("Checking the entry for 70: ");
  System.out.println("Value is: " + tree_map1.floorEntry(70));
 }
}

Sample Output:

Orginal TreeMap content: {10=Red, 20=Green, 40=Black, 50=White, 60=Pink
}                                                                      
Checking the entry for 10:                                             
Value is: 10=Red                                                       
Checking the entry for 30:                                             
Value is: 20=Green                                                     
Checking the entry for 70:                                             
Value is: 60=Pink

Java Code Editor:

Contribute your code and comments through Disqus.

Previous: Get a reverse order view of the keys contained in a given map.
Next: Get the greatest key less than or equal to the given key.