refactor 692

fishercoder1534 · fishercoder1534 · commit 5de18a62dbe6 · 2020-07-21T09:49:04.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_692.java b/src/main/java/com/fishercoder/solutions/_692.java
@@ -8,41 +8,13 @@
 import java.util.SortedSet;
 import java.util.TreeSet;
 
-/**
- * 692. Top K Frequent Words
- *
- * Given a non-empty list of words, return the k most frequent elements.
- * Your answer should be sorted by frequency from highest to lowest.
- * If two words have the same frequency, then the word with the lower alphabetical order comes first.
-
- Example 1:
- Input: ["i", "love", "leetcode", "i", "love", "coding"], k = 2
- Output: ["i", "love"]
- Explanation: "i" and "love" are the two most frequent words.
- Note that "i" comes before "love" due to a lower alphabetical order.
-
- Example 2:
- Input: ["the", "day", "is", "sunny", "the", "the", "the", "sunny", "is", "is"], k = 4
- Output: ["the", "is", "sunny", "day"]
- Explanation: "the", "is", "sunny" and "day" are the four most frequent words,
- with the number of occurrence being 4, 3, 2 and 1 respectively.
-
- Note:
- You may assume k is always valid, 1 ≤ k ≤ number of unique elements.
- Input words contain only lowercase letters.
-
- Follow up:
- Try to solve it in O(n log k) time and O(n) extra space.
- Can you solve it in O(n) time with only O(k) extra space?
-
- */
 public class _692 {
 
     public static class Solution1 {
         /**
          * O(n) extra space
          * O(nlogk) time
-         * */
+         */
         public List<String> topKFrequent(String[] words, int k) {
             Map<String, Integer> map = new HashMap<>();
             for (String word : words) {
