1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
| 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)
{
}
};
#include <vector>
#include <queue>
#include <utility>
using std::vector;
using std::queue;
class Solution {
public:
vector<vector<int> > levelOrder(TreeNode *root)
{
int i, n;
queue<TreeNode *> que;
vector<vector<int> > res;
TreeNode *p;
res.reserve(32);
if (root == nullptr) {
return res;
}
que.push(root);
while (!que.empty()) {
n = que.size();
vector<int> vec(n);
for (i = 0; i < n; i++) {
p = que.front();
que.pop();
vec[i] = p->val;
if (p->left) {
que.push(p->left);
}
if (p->right) {
que.push(p->right);
}
}
res.push_back(std::move(vec));
}
return res;
}
};
|
