/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if (p == null && q != null)
{
return false;
}
if (p != null && q == null)
{
return false;
}
if (p == null && q == null)
{
return true;
}
else if (p.val != q.val)
{
return false;
}
else if (p.left == null && p.right == null && q.left == null && q.right == null
&& p.val == q.val)
{
return true;
}
else
{
return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
}
}
}
水题提交了三次才通过,比较失败,还要是看着结果改正的
Same Tree
最新推荐文章于 2018-10-22 14:17:12 发布