Merge pull request #476 from AndroidQin/master

【第二周】

Author: GeekUniversity

Week_02/id_95/LeetCode_609_95.java

@@ -0,0 +1,32 @@
+class LeetCode_609_95 {
+    public List<List<String>> findDuplicate(String[] paths) {
+        List<List<String>> ans = new ArrayList(200);
+        HashMap<String,List<String>>map = new HashMap(500);
+        for(String path:paths)
+        {
+            String[] temp = path.split(" ");
+            String root = temp[0];
+            for(int i = 1;i < temp.length;i++)
+            {
+                int begin = temp[i].indexOf("(");
+                int end = temp[i].lastIndexOf(")");
+                String name = temp[i].substring(begin+1,end);
+                
+                String s = root+"/"+temp[i].substring(0,begin);
+                if(map.get(name) == null)
+                {
+                    List<String> list = new ArrayList(10);
+                    list.add(s);
+                    map.put(name,list);
+                }
+                else map.get(name).add(s);
+            }
+        }
+        for(Map.Entry<String,List<String> > entry:map.entrySet())
+            if(entry.getValue().size()>1)
+            ans.add(entry.getValue());
+        
+        return ans;
+    }
+}
+

Week_02/id_95/LeetCode_692_95.java

@@ -0,0 +1,24 @@
+class LeetCode_692_95 {
+      public List<String> topKFrequent(String[] words, int k) {
+             Map<String,Integer> countMap = new HashMap<>();
+        for(String word:words)
+            countMap.put(word,countMap.getOrDefault(word,0)+1);
+ 
+        PriorityQueue<String> priorityQueue = new PriorityQueue<>(k, new Comparator<String>() {
+           
+            public int compare(String o1, String o2) {
+                return countMap.get(o1).equals(countMap.get(o2))?       o2.compareTo(o1):countMap.get(o1)-countMap.get(o2);
+            }
+        });
+        for (String word : countMap.keySet()) {
+            priorityQueue.offer(word);
+            if (priorityQueue.size() > k) {
+                priorityQueue.poll();
+            }
+        }
+        List<String> ans = new ArrayList<>();
+        while (!priorityQueue.isEmpty()) ans.add(priorityQueue.poll());
+        Collections.reverse(ans);
+        return ans;
+    }
+}