feixiangcode
diff --git a/‎Week_03/id_102/leetcode_104_102.cpp‎
Lines changed: 18 additions & 0 deletions b/‎Week_03/id_102/leetcode_104_102.cpp‎
Lines changed: 18 additions & 0 deletions
diff --git a/‎Week_03/id_102/leetcode_429_102.cpp‎
Lines changed: 48 additions & 0 deletions b/‎Week_03/id_102/leetcode_429_102.cpp‎
Lines changed: 48 additions & 0 deletions
diff --git a/‎Week_03/id_102/leetcode_703_102.cpp‎
Lines changed: 32 additions & 0 deletions b/‎Week_03/id_102/leetcode_703_102.cpp‎
Lines changed: 32 additions & 0 deletions
diff --git a/‎Week_03/id_102/leetcode_997_102.cpp‎
Lines changed: 18 additions & 0 deletions b/‎Week_03/id_102/leetcode_997_102.cpp‎
Lines changed: 18 additions & 0 deletions
@@ -0,0 +1,18 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    int maxDepth(TreeNode* root) {
+        if (root == NULL) {
+            return 0;
+        }    
+        return max(maxDepth(root->left), maxDepth(root->right)) + 1;
+    }
+};
@@ -0,0 +1,48 @@
+/*
+// Definition for a Node.
+class Node {
+public:
+    int val;
+    vector<Node*> children;
+
+    Node() {}
+
+    Node(int _val, vector<Node*> _children) {
+        val = _val;
+        children = _children;
+    }
+};
+*/
+class Solution {
+public:
+    vector<vector<int>> levelOrder(Node* root) {
+        /* 首先判断root是否为空，为空直接返回空数组 */
+        if (root == NULL) {
+            return {};
+        }
+        
+        vector<vector<int>> res;
+        queue<Node*> q;
+        q.push(root);
+        
+        while (!q.empty()) {
+            /* 用level定义每层的数组 */
+            vector<int> level;
+            for (int i = q.size(); i > 0; --i) {
+                /*  对t的类型进行自动推导 */
+                auto t = q.front(); 
+                q.pop();
+                level.push_back(t->val);
+                /* 子节点放入children数组 */
+                if (!t->children.empty()) {
+                    /*  对t->children进行遍历 */
+                    for (auto a : t->children) {
+                        q.push(a);    
+                    }
+                }
+            }
+            res.push_back(level);
+        }
+        return res;
+    }
+};
@@ -0,0 +1,32 @@
+class KthLargest {
+public:
+    int n;
+    priority_queue<int, vector<int>, greater<int>> q; /* 建立最小堆*/ 
+    
+    KthLargest(int k, vector<int>& nums) {
+        n = k;
+        for (auto i:nums){
+            add(i);
+        }    
+    }
+    
+    int add(int val) {
+        /* 存放最大的K个数 */
+        if (q.size() < n) {
+            q.push(val);
+        } else {
+            if (q.top() < val) {
+                q.push(val);
+                q.pop();               
+            }
+        }
+        
+        return q.top();
+    }
+};
+
+/**
+ * Your KthLargest object will be instantiated and called as such:
+ * KthLargest* obj = new KthLargest(k, nums);
+ * int param_1 = obj->add(val);
+ */
@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int findJudge(int N, vector<vector<int>>& trust) {
+        vector<int> degrees(N+1);
+        for (const auto & t:trust) {
+            --degrees[t[0]];
+            ++degrees[t[1]];
+        }        
+      
+        for (int i = 1; i <= N; i++) {
+            if (degrees[i] == N - 1) {
+                return i;
+            }
+        }
+        
+        return -1;;
+    }
+};