Merge pull request algorithm001#561 from hfcc8685/master

GeekUniversity · web-flow · commit fab90890aad5 · 2019-05-06T12:13:46.000+08:00
[week3][071][hanfeng] week3 homework
diff --git a/Week_03/id_71/leetCode_104_71.js b/Week_03/id_71/leetCode_104_71.js
@@ -0,0 +1,19 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number}
+ */
+var maxDepth = function(root) {
+  if (root === null) {
+    return 0
+  }
+  let leftMaxDepth = maxDepth(root.left)
+  let rightMaxDepth = maxDepth(root.right)
+  return (leftMaxDepth > rightMaxDepth ? leftMaxDepth : rightMaxDepth) + 1
+};
diff --git a/Week_03/id_71/leetCode_997_71.js b/Week_03/id_71/leetCode_997_71.js
@@ -0,0 +1,30 @@
+/**
+ * @param {number} N
+ * @param {number[][]} trust
+ * @return {number}
+ */
+var findJudge = function(N, trust) {
+  if (N === 1 && trust.length > 0) {
+    return -1
+  }
+  let peopleBeTrusted = new Array(N)
+  for (let i = 0; i < peopleBeTrusted.length; i++) {
+    peopleBeTrusted[i] = 0
+  }
+  for (let i = 0; i < trust.length; i++) {
+    peopleBeTrusted[trust[i][0] - 1] = -1
+    if (peopleBeTrusted[trust[i][1] - 1] !== -1) {
+      peopleBeTrusted[trust[i][1] - 1]++
+    }
+  }
+  let judge = []
+  for (let i = 0; i < peopleBeTrusted.length; i++) {
+    if (peopleBeTrusted[i] === N - 1) {
+      judge.push(i)
+    }
+  }
+  if (judge.length === 1) {
+    return judge[0] + 1
+  }
+  return -1
+};
