Question

在我下面发布的代码中，我需要从HashMap中删除重复项（最高的字母值保留在地图中）并打印 k 最高值后的键。重复删除。我该怎么做呢？我尝试使用HashSet，但我很无能为力。

public ArrayList<String> mostOften(int k)
    {
        ArrayList<String> lista = new ArrayList<String>();
        HashMap<String,Integer> temp = new HashMap<String, Integer>();

        for(String it : wordList)
        {
            if(temp.containsKey(it))
                temp.put(it, temp.get(it)+1);
            else
                temp.put(it, 1);
        }

        temp = sortByValues(temp);

        Set<Integer> set = new HashSet<Integer>(temp.values());
        System.out.println(set);

        return lista;
    }

    private static HashMap sortByValues(HashMap map) 
    { 
        List list = new LinkedList(map.entrySet());
        Collections.sort(list, new Comparator() 
                         {
                             public int compare(Object o1, Object o2) 
                             {
                                 return ((Comparable)((Map.Entry) (o1)).getValue()).compareTo(((Map.Entry) (o2)).getValue());
                             }
                         });

        HashMap sortedHashMap = new LinkedHashMap();
        for (Iterator it = list.iterator(); it.hasNext();) 
        {
            Map.Entry entry = (Map.Entry) it.next();
            sortedHashMap.put(entry.getKey(), entry.getValue());
        } 
        return sortedHashMap;
    }

Answer 1

如果您正在尝试对单词进行频率计数，那么您将走错路。 Java 8更容易，更清晰。

您需要这些导入

import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
import java.util.Map;
import java.util.stream.Collectors;

代码

public static void main(String[] args) {
    printTopWords(Arrays.asList("Hello World Hello , Bye World".split(" ")), 2);
}

public static void printTopWords(List<String> words, int limit) {
    // using the Stream API
    words.stream()
            // create a map of words with the count of those words
            .collect(Collectors.groupingBy(w -> w, Collectors.counting()))
            // take that map as a stream of entries
            .entrySet().stream()
            // sort them by count in reverse order
            .sorted(Comparator.comparing(Map.Entry<String, Long>::getValue).reversed())
            // limit the number to get top Strings
            .limit(limit)
            // keep just the key ie. drop the count.
            .map(Map.Entry::getKey)
            // print them
            .forEach(System.out::println);
}

打印

Hello
World

Answer 2

如果你不熟悉java 8流和lambdas，那么下面的回答会对你有所帮助：

public class Java7Way {

public static void main(String[] args) {
    Map<String, Integer> myMap = new HashMap<>();
    myMap.put("A", 20);
    myMap.put("A", 38);
    myMap.put("B", 40);
    myMap.put("K", 23);
    System.out.println(sortByValue(myMap,2).toString());
}

public static <K, V extends Comparable<? super V>> Map<K, V>
        sortByValue(Map<K, V> map,int limit) {
    List<Map.Entry<K, V>> list
            = new LinkedList<>(map.entrySet());
    Collections.sort(list, new Comparator<Map.Entry<K, V>>() {
        @Override
        public int compare(Map.Entry<K, V> o1, Map.Entry<K, V> o2) {
            return (o1.getValue()).compareTo(o2.getValue());
        }
    }
            .reversed()//to arrange it in decending order
    );
    Map<K, V> result = new LinkedHashMap<>();//maintains the order which the entries were put into the map
    for (Map.Entry<K, V> entry : list) {
        if (limit == 0) {
            break;
        }
        result.put(entry.getKey(), entry.getValue());
        limit--;
    }
    return result;
}

}

输出：

{B=40, A=38}

Answer 3

我建议使用TreeBidiMap中的Apache Commons Collection。在此结构中，所有键和所有值都根据键和值类的自然顺序排序。

代码：

    BidiMap<String,Integer> temp = new TreeBidiMap<String, Integer>();
    for(String it : wordList)
    {
        if(temp.containsKey(it))
            temp.put(it, temp.get(it)+1);
        else
            temp.put(it, 1);
    }

    // print values unsing natural sorting in reverse order          
    BidiMap inverse = temp.inverseBidiMap();
    for (MapIterator it = inverse.mapIterator(); it.hasPrevious();) {
       String k = it.next();
       Integer s = it.getValue();  
       System.out.printLn(s + " = " + k);
    }

从HashMap获取k个最高值

3 个答案: