-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution_101.java
More file actions
68 lines (59 loc) · 1.44 KB
/
Solution_101.java
File metadata and controls
68 lines (59 loc) · 1.44 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
package com.hilbert25.leetcode;
import java.util.ArrayList;
import java.util.List;
/**
* @author : hilbert25
* @version 创建时间：2017年5月3日 下午4:48:42 LeetCode com.hilbert25.leetcode
* Solution_101
*/
public class Solution_101 {
public static void main(String[] args) {
// TODO Auto-generated method stub
}
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) {
val = x;
}
}
public boolean isSymmetric(TreeNode root) {
if (root == null)
return true;
List<String> leftList = new ArrayList<>();
leftVisit(root.left, leftList);
List<String> rightList = new ArrayList<>();
rightVisit(root.right, rightList);
if (leftList.size() != rightList.size())
return false;
else {
leftList.forEach(a -> System.out.print(a));
System.out.println();
rightList.forEach(a -> System.out.print(a));
for (int i = 0; i < leftList.size(); i++) {
if (!leftList.get(i).equals(rightList.get(i)))
return false;
}
}
return true;
}
public void leftVisit(TreeNode node, List<String> list) {
if (node == null) {
list.add("a");
return;
}
list.add(String.valueOf(node.val));
leftVisit(node.left, list);
leftVisit(node.right, list);
}
public void rightVisit(TreeNode node, List<String> list) {
if (node == null) {
list.add("a");
return;
}
list.add(String.valueOf(node.val));
rightVisit(node.right, list);
rightVisit(node.left, list);
}
}