1 题目
输入两棵二叉树A和B,判断B是不是A的子结构。(约定空树不是任意一个树的子结构)
B是A的子结构, 即 A中有出现和B相同的结构和节点值。
示例 1:
输入:A = [1,2,3], B = [3,1]
输出:false
示例 2:
输入:A = [3,4,5,1,2], B = [4,1]
输出:true
限制:
0 <= 节点个数 <= 10000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/shu-de-zi-jie-gou-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
2 Java
2.1 @方法一(双层递归)
以A的每个节点为根节点,和B比较是否一样
遍历A是一个递归,针对每个遍历的A节点和B比较是否一样是另一个递归
前者返回A是否存在B的结构,后者返回a和b是否一样
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean isSubStructure(TreeNode A, TreeNode B) {
if(A == null || B == null) return false;
return isEqual(A, B) || isSubStructure(A.left, B) || isSubStructure(A.right, B);
}
public boolean isEqual(TreeNode a, TreeNode b){
if(b == null) return true;
if(a == null || a.val != b.val) return false;
return isEqual(a.left, b.left) && isEqual(a.right, b.right);
}
}
2.2 方法二(遍历递归)
/**
* Definition for A binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
// 判断B是否为A的子结构
public boolean isSubStructure(TreeNode A, TreeNode B) {
// if出口
if(A == null || B == null) return false;
// 遍历递归:前/中/后 皆可
boolean m = isEqual(A, B); // 判断A、B是否相等
boolean l = isSubStructure(A.left, B);
boolean r = isSubStructure(A.right, B);
return m || l || r;
}
public boolean isEqual(TreeNode A, TreeNode B){
// if出口
if(B == null) return true;
if(A == null) return false;
// 遍历递归:前/中/后 皆可
boolean m = (A.val == B.val);
boolean l = isEqual(A.left, B.left);
boolean r = isEqual(A.right, B.right);
return m && l && r;
}
}