push all

xwk1246 · xwk1246 · commit 1d698cee68c5 · 2021-08-28T22:33:00.000+08:00
diff --git a/104.maximum-depth-of-binary-tree.cpp b/104.maximum-depth-of-binary-tree.cpp
@@ -0,0 +1,41 @@
+/*
+ * @lc app=leetcode id=104 lang=cpp
+ *
+ * [104] Maximum Depth of Binary Tree
+ */
+
+ // @lc code=start
+ /**
+  * Definition for a binary tree node.
+  * struct TreeNode {
+  *     int val;
+  *     TreeNode *left;
+  *     TreeNode *right;
+  *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+  *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+  *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+  * };
+  */
+class Solution {
+public:
+    int maxDepth(TreeNode* root) {
+        if (!root)return 0;
+        queue<TreeNode*>q;
+        q.push(root);
+        int height = 0;
+        while (!q.empty()) {
+            height++;
+            int size = q.size();
+            for (int i = 0; i < size; i++) {
+                if (q.front()->left)
+                    q.push(q.front()->left);
+                if (q.front()->right)
+                    q.push(q.front()->right);
+                q.pop();
+            }
+        }
+        return height;
+    }
+};
+// @lc code=end
+
diff --git a/107.binary-tree-level-order-traversal-ii.cpp b/107.binary-tree-level-order-traversal-ii.cpp
@@ -0,0 +1,46 @@
+#include <vector>
+#include <queue>
+#include <algorithm>
+using namespace std;
+/*
+ * @lc app=leetcode id=107 lang=cpp
+ *
+ * [107] Binary Tree Level Order Traversal II
+ */
+
+ // @lc code=start
+ /**
+  * Definition for a binary tree node.
+  * struct TreeNode {
+  *     int val;
+  *     TreeNode *left;
+  *     TreeNode *right;
+  *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+  *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+  *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+  * };
+  */
+class Solution {
+public:
+    vector<vector<int>> levelOrderBottom(TreeNode* root) {
+        queue<TreeNode*>q;
+        vector<vector<int>>result;
+        if (root == nullptr)return {};
+        q.push(root);
+        while (!q.empty()) {
+            vector <int>tmp;
+            int size = q.size();
+            for (int i = 0; i < size; i++) {
+                if (q.front()->left != nullptr)q.push(q.front()->left);
+                if (q.front()->right != nullptr)q.push(q.front()->right);
+                tmp.push_back(q.front()->val);
+                q.pop();
+            }
+            result.push_back(tmp);
+        }
+        reverse(result.begin(), result.end());
+        return result;
+    }
+};
+// @lc code=end
+
diff --git a/111.minimum-depth-of-binary-tree.cpp b/111.minimum-depth-of-binary-tree.cpp
@@ -0,0 +1,42 @@
+/*
+ * @lc app=leetcode id=111 lang=cpp
+ *
+ * [111] Minimum Depth of Binary Tree
+ */
+
+ // @lc code=start
+ /**
+  * Definition for a binary tree node.
+  * struct TreeNode {
+  *     int val;
+  *     TreeNode *left;
+  *     TreeNode *right;
+  *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+  *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+  *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+  * };
+  */
+class Solution {
+public:
+    int minDepth(TreeNode* root) {
+        if (!root)return 0;
+        queue<TreeNode*>q;
+        q.push(root);
+        int minHeight = 0;
+        while (!q.empty()) {
+            minHeight++;
+            int size = q.size();
+            for (int i = 0; i < size; i++) {
+                if (!q.front()->left && !q.front()->right) return minHeight;
+                if (q.front()->left)
+                    q.push(q.front()->left);
+                if (q.front()->right)
+                    q.push(q.front()->right);
+                q.pop();
+            }
+        }
+        return minHeight;
+    }
+};
+// @lc code=end
+
diff --git a/116.populating-next-right-pointers-in-each-node.cpp b/116.populating-next-right-pointers-in-each-node.cpp
@@ -0,0 +1,53 @@
+#include <queue>
+using namespace std;
+/*
+ * @lc app=leetcode id=116 lang=cpp
+ *
+ * [116] Populating Next Right Pointers in Each Node
+ */
+
+ // @lc code=start
+ /*
+ // Definition for a Node.
+ class Node {
+ public:
+     int val;
+     Node* left;
+     Node* right;
+     Node* next;
+
+     Node() : val(0), left(NULL), right(NULL), next(NULL) {}
+
+     Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}
+
+     Node(int _val, Node* _left, Node* _right, Node* _next)
+         : val(_val), left(_left), right(_right), next(_next) {}
+ };
+ */
+
+class Solution {
+public:
+    Node* connect(Node* root) {
+        if (!root)return root;
+        queue<Node*>q;
+        q.push(root);
+        while (!q.empty()) {
+            int size = q.size();
+            Node* tmp = nullptr;
+            for (int i = 0; i < size; i++) {
+                if (tmp) {
+                    tmp->next = q.front();
+                }
+                tmp = q.front();
+                if (q.front()->left)
+                    q.push(q.front()->left);
+                if (q.front()->right)
+                    q.push(q.front()->right);
+                q.pop();
+            }
+        }
+        return root;
+    }
+};
+// @lc code=end
+
diff --git a/117.populating-next-right-pointers-in-each-node-ii.cpp b/117.populating-next-right-pointers-in-each-node-ii.cpp
@@ -0,0 +1,53 @@
+#include <queue>
+using namespace std;
+/*
+ * @lc app=leetcode id=117 lang=cpp
+ *
+ * [117] Populating Next Right Pointers in Each Node II
+ */
+
+ // @lc code=start
+ /*
+ // Definition for a Node.
+ class Node {
+ public:
+     int val;
+     Node* left;
+     Node* right;
+     Node* next;
+
+     Node() : val(0), left(NULL), right(NULL), next(NULL) {}
+
+     Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}
+
+     Node(int _val, Node* _left, Node* _right, Node* _next)
+         : val(_val), left(_left), right(_right), next(_next) {}
+ };
+ */
+
+class Solution {
+public:
+    Node* connect(Node* root) {
+        if (!root)return root;
+        queue<Node*>q;
+        q.push(root);
+        while (!q.empty()) {
+            int size = q.size();
+            Node* tmp = nullptr;
+            for (int i = 0; i < size; i++) {
+                if (tmp) {
+                    tmp->next = q.front();
+                }
+                tmp = q.front();
+                if (q.front()->left)
+                    q.push(q.front()->left);
+                if (q.front()->right)
+                    q.push(q.front()->right);
+                q.pop();
+            }
+        }
+        return root;
+    }
+};
+// @lc code=end
+
diff --git a/199.binary-tree-right-side-view.cpp b/199.binary-tree-right-side-view.cpp
@@ -0,0 +1,46 @@
+#include <queue>
+#include <vector>
+using namespace std;
+/*
+ * @lc app=leetcode id=199 lang=cpp
+ *
+ * [199] Binary Tree Right Side View
+ */
+
+ // @lc code=start
+ /**
+  * Definition for a binary tree node.
+  * struct TreeNode {
+  *     int val;
+  *     TreeNode *left;
+  *     TreeNode *right;
+  *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+  *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+  *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+  * };
+  */
+class Solution {
+public:
+    vector<int> rightSideView(TreeNode* root) {
+        vector <int> result;
+        if (root == nullptr) return {};
+        queue<TreeNode*>q;
+        q.push(root);
+        while (!q.empty()) {
+            int size = q.size();
+            for (int i = 0; i < size; i++) {
+                if (q.front()->left != nullptr) q.push(q.front()->left);
+                if (q.front()->right != nullptr) q.push(q.front()->right);
+                if (i == size - 1) {
+                    result.push_back(q.front()->val);
+                }
+                q.pop();
+            }
+        }
+        return result;
+
+
+    }
+};
+// @lc code=end
+
diff --git a/429.n-ary-tree-level-order-traversal.cpp b/429.n-ary-tree-level-order-traversal.cpp
@@ -0,0 +1,79 @@
+#include <vector>
+#include <queue>
+using namespace std;
+class Node {
+public:
+    int val;
+    vector<Node*> children;
+
+    Node() {}
+
+    Node(int _val) {
+        val = _val;
+    }
+
+    Node(int _val, vector<Node*> _children) {
+        val = _val;
+        children = _children;
+    }
+};
+/*
+ * @lc app=leetcode id=429 lang=cpp
+ *
+ * [429] N-ary Tree Level Order Traversal
+ */
+
+ // @lc code=start
+ /*
+ // Definition for a Node.
+ class Node {
+ public:
+     int val;
+     vector<Node*> children;
+
+     Node() {}
+
+     Node(int _val) {
+         val = _val;
+     }
+
+     Node(int _val, vector<Node*> _children) {
+         val = _val;
+         children = _children;
+     }
+ };
+ */
+
+class Solution {
+public:
+    vector<vector<int>> levelOrder(Node* root) {
+        if (!root) return{};
+        queue<Node*>q;
+        vector<vector<int>>result;
+        q.push(root);
+        while (!q.empty()) {
+            vector<int> tmp;
+            int size = q.size();
+            for (int i = 0; i < size; i++) {
+                for (auto j : q.front()->children) {
+                    if (j != nullptr)q.push(j);
+                }
+                tmp.push_back(q.front()->val);
+                q.pop();
+            }
+            result.push_back(tmp);
+        }
+        return result;
+    }
+};
+// @lc code=end
+
+int main() {
+    Solution s;
+    vector<Node*> v = { new Node(3), new Node(2), new Node(4) };
+
+    Node* n = new Node(1, v);
+
+    s.levelOrder(n);
+    return 0;
+}
diff --git a/515.find-largest-value-in-each-tree-row.cpp b/515.find-largest-value-in-each-tree-row.cpp
diff --git a/637.average-of-levels-in-binary-tree.cpp b/637.average-of-levels-in-binary-tree.cpp
