题目描述
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
思路:
- 从上往下找相同的节点,一旦找到一个,就开始判断子树是否相等。
- 如果不相等,那么就往左往右去找,可以用||连起来
/*
struct TreeNode {
int val;
struct TreeNode *left;https://www.nowcoder.com/profile/2140056/codeBooks?problemId=3732
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
bool TestFun(TreeNode* pRoot1, TreeNode* pRoot2)
{
if(pRoot2==NULL)
return true;
else if(pRoot1==NULL)
return false;
if(pRoot1->val!=pRoot2->val)
return false;
return TestFun(pRoot1->left,pRoot2->left)&&TestFun(pRoot1->right,pRoot2->right);
}
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
bool result=false;
if(pRoot1!=NULL&&pRoot2!=NULL)
{
if(pRoot1->val==pRoot2->val)
result = TestFun(pRoot1,pRoot2);
if(!result)
result=HasSubtree(pRoot1->left,pRoot2)||HasSubtree(pRoot1->right,pRoot2);
}
return result;
}
};
尽量不要自己调试,自己用脑子想代码怎么运行得。
JAVA解法
/**
* 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) {
boolean res = false;
if (A == null && B == null) {
return true;
}
if (B == null ^ A == null) {
return false;
}
if (A.val == B.val) {
res = doIsSubStructure(A, B);
}
if (!res) {
res = isSubStructure(A.left, B) || isSubStructure(A.right, B);
}
return res;
}
private boolean doIsSubStructure(TreeNode a, TreeNode b) {
if (b == null) {
return true;
}
if (a == null) {
return false;
}
if (a.val == b.val) {
return doIsSubStructure(a.left, b.left) && doIsSubStructure(a.right, b.right);
}
return false;
}
}