Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
50 lines (39 loc) · 1.1 KB

File metadata and controls

50 lines (39 loc) · 1.1 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
/**
* 剑指Offer,把二叉树打印成多行
*/
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
public class PrintTreeByLine {
ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
ArrayList<ArrayList<Integer>> result = new ArrayList<>();
if (pRoot == null) {
return result;
}
Queue<TreeNode> q = new LinkedList<>();
int current = 1;
int next = 0;
q.offer(pRoot);
ArrayList<Integer> line = new ArrayList<>();
while ( !q.isEmpty() ) {
TreeNode t = q.poll();
line.add(t.val);
current--;
if (t.left != null) {
q.offer(t.left);
next++;
}
if (t.right != null) {
q.offer(t.right);
next++;
}
if (current == 0) {
result.add(line);
line = new ArrayList<>();
current = next;
next = 0;
}
}
return result;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.