searching in a hashmap

[mickey0]

Hello,
I have an hasmap with some words and their frequecy. Now, I need to delete the word with highest frequency. I'm new to Java and It's not clear to me how work/retrieve the content of a hash map; see this below. I thought to do this foreach to delete the word (but I don't like this way). Any suggestions?

HashMap<String, Integer> text = new HashMap<String, Integer>();
    int max = 0;
    String word = null;
    for (Integer freqOfWord : text.values() ) {
        if ( freqOfWord > max ) {
            max = freqOfWord;
            word = //text.getActualWord() //how obtain the actual word?
        }
    }
 //       text.delete(word);
 

thanks

[chaarmann]

text.values() returns a collection, so no need to make a loop. Just use a single line:
max = Collections.max(text.values()).

Can you please clarify:
If 2 or more words have the same frequency, and this frequency is the maximum, do you then want to delete all of these words or only the first of these words?

To delete the words, just loop over all keys of your hashmap with text.keySet(). Inside the loop, get the current value of the current key with text.get(key). Compare if this value equals the maximum value. If yes, delete the entry with text.delete(key).

[mickey0]

if there are more then one with frequency max, I need to delete all those!

[jkmyoung]

Delete from the hashmap or delete from somewhere else? Assuming you have max value,

for (String word : text.keySet() ) { 
  if(text.get(word).Equals(max)){
  //remove word.
  }
}
 

[Tassos Souris]

It is better to declare your objects with interfaces rather than their implementation. So, in my opinion of course, it is better to write:

Map<String,Integer> text = new HashMap<String,Integer>();
 

Not something very important just a tip from me:P

[JosAH]

Also just a thought: maybe you could manage two Maps:

Map<String, Integer> freq= new HashMap<String, Integer>();
Map<Integer, Set<String>> inv= new TreeSet<Integer, Set<String>>();
 

The first map is your map; the second map is the inverse of the first Map. Note that more than one String can be the mapping of a single Integer. Store the negative of the Integer key in the second Map. This enables you to retrieve all the words with a maximum frequency count in one step (it'll be the first mapping). Updating the second map is a bit of a burden but it doesn't take rocket science to do it.

kind regards,

Jos