给定字符串数组和正数K，返回词频最大的前K个字符串问题解法

问题描述

        给定一个由字符串组成的数组String[] strs，给定一个正数K，返回词频最大的前K个字符串，假设结果是唯一的。、

思路

        先用hash表统计每个字符串的词频。再用小根堆，围成前k个数的门槛，小根堆永远放的是当前遍历过的元素的前K大，堆顶是能进入小根堆的门槛。

代码

    public static class Node {
        public String str;
        public int times;

        public Node(String s, int t) {
            str = s;
            times = t;
        }
    }

    public static class NodeComparator implements Comparator<Node> {

        @Override
        public int compare(Node o1, Node o2) {
            return o1.times - o2.times;
        }
    }

    public static void printTopKAndRank(String[] arr, int topK) {
        if (arr == null || arr.length == 0 || topK < 1 || topK > arr.length) {
            return;
        }
        HashMap<String, Integer> map = new HashMap<>();
        for (String str : arr) {
            if (!map.containsKey(str)) {
                map.put(str, 1);
            }
            map.put(str, map.get(str) + 1);
        }

        PriorityQueue<Node> heap = new PriorityQueue<>(new NodeComparator());
        for (Map.Entry<String, Integer> entry : map.entrySet()) {
            Node cur = new Node(entry.getKey(), entry.getValue());
            if (heap.size() < topK) {
                heap.add(cur);
            } else {
                if (heap.peek().times < cur.times) {
                    heap.poll();
                    heap.add(cur);
                }
            }
        }
        //        while (!heap.isEmpty()) {
        //       System.out.println(heap.poll().str);
        // }
        System.out.println(heap.poll().str);
    }

    public static String[] generateRandomArray(int len, int max) {
        String[] res = new String[len];
        for (int i = 0; i != len; i++) {
            res[i] = String.valueOf((int) (Math.random() * (max + 1)));
        }
        return res;
    }

    public static void printArray(String[] arr) {
        for (int i = 0; i != arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }

    public static void main(String[] args) {
        String[] arr1 = {"A", "B", "A", "C", "A", "C", "B", "B", "K"};
        printTopKAndRank(arr1, 2);

        String[] arr2 = generateRandomArray(50, 10);
        int topK = 3;
        printArray(arr2);
        printTopKAndRank(arr2, topK);
    }