Merge pull request algorithm001#628 from DevinSu/master

GeekUniversity · web-flow · commit 2204deb8ee4d · 2019-05-06T12:11:54.000+08:00
第3次作业
diff --git a/Week_03/id_91/LeetCode_104_091.java b/Week_03/id_91/LeetCode_104_091.java
@@ -0,0 +1,17 @@
+class TreeNode{
+    TreeNode left;
+    TreeNode right;
+    int value;
+
+}
+class Solution {
+    public int maxDepth(TreeNode root) {
+        if (root == null) {
+            return 0;
+        } else {
+            int left_height = maxDepth(root.left);
+            int right_height = maxDepth(root.right);
+            return java.lang.Math.max(left_height, right_height) + 1;
+        }
+    }
+}
diff --git a/Week_03/id_91/LeetCode_703_091.java b/Week_03/id_91/LeetCode_703_091.java
@@ -0,0 +1,25 @@
+import java.util.PriorityQueue;
+
+class LeetCode_703_091 {
+    final PriorityQueue<Integer> q ;
+    final int k;
+    public LeetCode_703_091(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();
+    }
+}
