看到树的递归有点心慌慌,但是,。,随意一写就OK了,有的时候太紧张还是不行,一点要慢点
public class Solution {
public boolean isSymmetric(TreeNode root) {
if (root == null) {
return true;
}
return is(root.left, root.right);
}
public boolean is(TreeNode a, TreeNode b) {
if (a == null && b == null) {
return true;
}
if (a == null || b == null) {
return false;
}
if (a.val != b.val) {
return false;
}
return is(a.left, b.right) && is(a.right, b.left);
}
}