Top K Frequently Mentioned Keywords

最新推荐文章于 2024-04-02 11:58:21 发布

lstrue

最新推荐文章于 2024-04-02 11:58:21 发布

阅读量375

点赞数

分类专栏：技术文章

本文链接：https://blog.csdn.net/lstrue/article/details/105023365

版权

技术文章专栏收录该内容

21 篇文章 0 订阅

订阅专栏

//这里意思是如果出现在一个sentence里面只算一次
public List<String> solve(int k, String[] keywords, String[] reviews) {
   Map<String, Integer> hm = new HashMap<>();
   for (String sentence : reviews) {
      Set<String> hs = new HashSet<>();
      String[] words = sentence.split("\\W");
      for (String word : words) {
         hs.add(word.toLowerCase());
      }
      for(String word : hs){
         word = word.toLowerCase();
         hm.put(word, hm.getOrDefault(word, 0) + 1);
      }
   }
   PriorityQueue<String> pq = new PriorityQueue<>((a, b) -> hm.get(a) != hm.get(b) ? hm.get(a) - hm.get(b) : b.compareTo(a));
   for (String str : keywords) {
      str = str.toLowerCase();
      if (hm.containsKey(str)) {
         pq.offer(str);
      }//if word is not in reviews need to sort alphabetically?
      if (pq.size() > k) {
         pq.poll();
      }
   }
   List<String> res = new ArrayList<>();
   while (!pq.isEmpty()) {
      res.add(pq.poll());
   }
   Collections.reverse(res);
   return res;
}

https://leetcode.com/discuss/interview-question/542597/