0429 solved.

liuyubobobo · liuyubobobo · commit 9687c4bd59b0 · 2018-10-30T18:53:56.000-07:00
diff --git a/0429-N-ary-Tree-Level-Order-Traversal/cpp-0429/CMakeLists.txt b/0429-N-ary-Tree-Level-Order-Traversal/cpp-0429/CMakeLists.txt
@@ -0,0 +1,7 @@
+cmake_minimum_required(VERSION 3.5)
+project(cpp_0429)
+
+set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
+
+set(SOURCE_FILES main2.cpp)
+add_executable(cpp_0429 ${SOURCE_FILES})
diff --git a/0429-N-ary-Tree-Level-Order-Traversal/cpp-0429/main.cpp b/0429-N-ary-Tree-Level-Order-Traversal/cpp-0429/main.cpp
@@ -0,0 +1,64 @@
+/// Source : https://leetcode.com/problems/n-ary-tree-level-order-traversal/
+/// Author : liuyubobobo
+/// Time   : 2018-10-30
+
+#include <iostream>
+#include <vector>
+#include <queue>
+
+using namespace std;
+
+
+/// Definition for a Node.
+class Node {
+public:
+    int val = NULL;
+    vector<Node*> children;
+
+    Node() {}
+
+    Node(int _val, vector<Node*> _children) {
+        val = _val;
+        children = _children;
+    }
+};
+
+
+/// BFS
+/// Store step in the queue
+///
+/// Time Complexity: O(n)
+/// Space Complexity: O(n)
+class Solution {
+public:
+    vector<vector<int>> levelOrder(Node* root) {
+
+        vector<vector<int>> res;
+        if(!root)
+            return res;
+
+        queue<pair<Node*, int>> q;
+        q.push(make_pair(root, 0));
+        while(!q.empty()){
+            Node* cur = q.front().first;
+            int step = q.front().second;
+            q.pop();
+
+            if(step == res.size())
+                res.push_back({cur->val});
+            else
+                res[step].push_back(cur->val);
+
+            for(Node* next: cur->children)
+                q.push(make_pair(next, step + 1));
+        }
+
+        return res;
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/0429-N-ary-Tree-Level-Order-Traversal/cpp-0429/main2.cpp b/0429-N-ary-Tree-Level-Order-Traversal/cpp-0429/main2.cpp
@@ -0,0 +1,63 @@
+/// Source : https://leetcode.com/problems/n-ary-tree-level-order-traversal/
+/// Author : liuyubobobo
+/// Time   : 2018-10-30
+
+#include <iostream>
+#include <vector>
+#include <queue>
+
+using namespace std;
+
+
+/// Definition for a Node.
+class Node {
+public:
+    int val = NULL;
+    vector<Node*> children;
+
+    Node() {}
+
+    Node(int _val, vector<Node*> _children) {
+        val = _val;
+        children = _children;
+    }
+};
+
+
+/// BFS, using Queue
+/// No need to store step in the queue :-)
+///
+/// Time Complexity: O(n)
+/// Space Complexity: O(n)
+class Solution {
+public:
+    vector<vector<int>> levelOrder(Node* root) {
+
+        vector<vector<int>> res;
+        if(!root)
+            return res;
+
+        queue<Node*> q;
+        q.push(root);
+        while(!q.empty()){
+            int n = q.size();
+            vector<int> level;
+            for(int i = 0; i < n; i ++){
+                Node* node = q.front();
+                q.pop();
+                level.push_back(node->val);
+                for(Node* next: node->children)
+                    q.push(next);
+            }
+            res.push_back(level);
+        }
+
+        return res;
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -326,6 +326,7 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/description/) | [无] | [C++](0416-Partition-Equal-Subset-Sum/cpp-0416/) | [Java](0416-Partition-Equal-Subset-Sum/java-0416/src/) | |
 | 417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/description/) | [无] | | [Java](0417-Pacific-Atlantic-Water-Flow/java-0417/src/) | |
 | | | | | | |
+| 429 | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal/) | [无] | [C++](0429-N-ary-Tree-Level-Order-Traversal/cpp-0429/) | | |
 | 430 | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/description/) | [无] | [solution](0430-Flatten-a-Multilevel-Doubly-Linked-List/cpp-0430/) | | |
 | | | | | | |
 | 434 | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/description/) | | [C++](0434-Number-of-Segments-in-a-String/cpp-0434/) | | |
