class Solution {
public:
bool compare(TreeNode* p, TreeNode* q)
{
if (p == nullptr && q == nullptr)
return true;
else if (p == nullptr && q != nullptr)
return false;
else if (q == nullptr && p != nullptr)
return false;
else if (p->val != q->val)
return false;
else
{
int leftSide = compare(p->left, q->left);
int rightSide = compare(p->right, q->right);
return leftSide && rightSide;
}
}
bool isSameTree(TreeNode* p, TreeNode* q) {
return compare(p, q);
}
};
LeetCode100.相同的树
最新推荐文章于 2024-07-19 19:11:19 发布