剑指offer面试题18
牛客网测试地址:https://www.nowcoder.com/questionTerminal/6e196c44c7004d15b1610b9afca8bd88
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
public class Solution {
// 判断root2是不是root1的子结构
public boolean HasSubtree(TreeNode root1, TreeNode root2) {
// 约定空树不是任意一个树的子结构
if (root1 == null || root2 == null)
return false;
boolean result = false;
if (root1.val == root2.val)
result = DoesTree1HaveTree2(root1, root2);
if (!result)
result = HasSubtree(root1.left, root2);
if (!result)
result = HasSubtree(root1.right, root2);
return result;
}
private boolean DoesTree1HaveTree2(TreeNode root1, TreeNode root2) {
// 如果root2为空,直接返回true
if (root2 == null)
return true;
// 如果root1为空,root2不为空,返回false
if (root1 == null)
return false;
// 如果两棵树都不为空
if (root1.val != root2.val)
return false;
//如果两棵树当前节点值相同,继续判断左子树和右子树
return DoesTree1HaveTree2(root1.left, root2.left) && DoesTree1HaveTree2(root1.right, root2.right);
}
}
// 树节点类
class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}