-
Notifications
You must be signed in to change notification settings - Fork 0
/
LeetCode114.java
49 lines (43 loc) · 1.34 KB
/
LeetCode114.java
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
import java.util.ArrayList;
import java.util.List;
import util.TreeNode;
public class LeetCode114 {
public static void main(String[] args) {
// 输入:root = [1,2,5,3,4,null,6]
// 输出:[1,null,2,null,3,null,4,null,5,null,6]
TreeNode root = null;
root = TreeNode.buildTree(new Integer[] { 1, 2, 5, 3, 4, null, 6 });
new Solution114().flatten(root);
System.out.println(root);
// 输入:root = []
// 输出:[]
root = TreeNode.buildTree(new Integer[] {});
new Solution114().flatten(root);
System.out.println(root);
// 输入:root = [0]
// 输出:[0]
root = TreeNode.buildTree(new Integer[] { 0 });
new Solution114().flatten(root);
System.out.println(root);
}
}
class Solution114 {
public void flatten(TreeNode root) {
List<TreeNode> order = new ArrayList<TreeNode>();
dfs(root, order);
TreeNode dumNode = new TreeNode();
for (TreeNode node : order) {
dumNode.left = null;
dumNode.right = node;
dumNode = dumNode.right;
}
}
public void dfs(TreeNode root, List<TreeNode> order) {
if (root == null) {
return;
}
order.add(root);
dfs(root.left, order);
dfs(root.right, order);
}
}