本文共 772 字,大约阅读时间需要 2 分钟。
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; * this.left = left; * this.right = right; * } * } */class Solution { public boolean isSameTree(TreeNode p, TreeNode q) { if(p == null && q == null) { //两者都为空 一样 return true; } if(p == null || q == null) { //一个空一个不空 不一样 return false; } if(p.val != q.val) { //两个都不为空 但是值不一样 return false; } return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);//递归比较 }}
转载地址:http://kmhzi.baihongyu.com/