Home/ Questions/Q 6088481
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-23T11:59:23+00:00

I am using Java for this program, and I currently have a situation where

  • 0

I am using Java for this program, and I currently have a situation where I want to add key/value pairs to a table with integer keys, like

add (1, "Bobby")
add (6, "Sue")
add (3, "Mary")
add (8, "John")
add (15, "Joe")

So naturally I want to do something like a hashtable, but when I do a lookup, if it doesn’t find the exact value, I would like it to return the nearest key that isn’t greater than the requested key.

So for example, if I lookup 7, it should return “Sue”, but if I lookup 9, it should return “John”

I’m hoping to use one of the java util classes (HashTable, TreeMap, etc) but I’m not quite sure how to do it.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    TreeMap from the collections library provides the functionality you’re looking for

    TreeMap<Integer,String> tree = new TreeMap<Integer,String>();
tree.put (1, "Bobby");
tree.put(6, "Sue");
tree.put (3, "Mary");
tree.put (8, "John");
tree.put (15, "Joe");
System.out.println(tree.floorEntry(7)); // Sue
System.out.println(tree.floorEntry(9)); // John
    • 0