Merge pull request algorithm001#570 from oxcz/master

GeekUniversity · web-flow · commit c43659d67b58 · 2019-05-06T12:12:07.000+08:00
135
diff --git a/Week_03/id_135/LeetCode_703_135.java b/Week_03/id_135/LeetCode_703_135.java
@@ -0,0 +1,24 @@
+class KthLargest {
+
+    final PriorityQueue<Integer> q ;
+    final int k;
+    public KthLargest(int k, int[] nums) {
+        this.k = k;
+        q = new PriorityQueue<Integer>(k);
+        for(int i: nums) {
+            add(i);
+        }
+    }
+    
+    public int add(int val) {
+        if(q.size() < k) {
+            q.offer(val);
+            
+        }
+        else if(q.peek() < val) {
+            q.poll();
+            q.offer(val);
+        }
+        return q.peek();
+    }
+}
diff --git a/Week_03/id_135/LeetCode_997_135.java b/Week_03/id_135/LeetCode_997_135.java
@@ -0,0 +1,27 @@
+class Solution {
+    public int findJudge(int N, int[][] trust) {
+
+        if(N == 1){
+            return N;
+        }
+        HashMap<Integer ,Integer> hashMap = new HashMap(trust.length);
+        int[] ints = new int[trust.length];
+
+        for(int i=0;i<trust.length;i++){
+            ints[i] = trust[i][0];
+            hashMap.put(trust[i][1],hashMap.getOrDefault(trust[i][1],0)+1);
+        }
+
+        for(Integer key :hashMap.keySet()){
+            if(hashMap.get(key) ==N-1 ){
+                for(Integer s:ints){
+                    if(s.equals(key)){
+                        return -1;
+                    }
+                }
+                return key;
+            }
+        }
+        return -1;
+    }
+}
