Repository navigation
Expand file tree
/
Copy pathleetcode_107.cpp
More file actions
110 lines (87 loc) · 1.71 KB
/
Copy pathleetcode_107.cpp
File metadata and controls
110 lines (87 loc) · 1.71 KB
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
/*
* =========================================================================
*
* FileName: leetcode_107.cpp
*
* Description:
*
* Version: 1.0
* Created: 2018-11-20 09:50:07
* Last Modified: 2018-11-20 11:08:01
* Revision: none
* Compiler: gcc
*
* Author: zt ()
* Organization:
*
* =========================================================================
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stddef.h>
#include <string.h>
#include <signal.h>
#include <errno.h>
#include <unistd.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <sys/socket.h>
#include <iostream>
#include <memory>
#include <algorithm>
#include <vector>
#include <thread>
#include <mutex>
#include <map>
#include <list>
#include <string>
#include <functional>
using namespace std;
struct TreeNode
{
int val;
TreeNode* left;
TreeNode* right;
TreeNode ( int x ) : val ( x ), left ( NULL ), right ( NULL ) {}
};
vector<vector<int>> levelOrderBottom ( TreeNode* root )
{
if ( !root )
return {};
vector<vector<int>> ret;
vector<TreeNode*> tmp;
int e = 1;
int c = 0;
int i = 0;
tmp.push_back ( root );
ret.push_back ( {} );
for ( ; ; )
{
ret[i].push_back ( tmp[c]->val );
if ( tmp[c]->left )
tmp.push_back ( tmp[c]->left );
if ( tmp[c]->right )
tmp.push_back ( tmp[c]->right );
++c;
if ( c == e )
{
if ( e == tmp.size() )
break;
else
{
e = tmp.size();
ret.push_back ( {} );
++i;
}
}
}
reverse ( ret.begin(), ret.end() );
return ret;
}
int main ( int argc, char* argv[] )
{
( void ) argc;
( void ) argv;
return 0;
}