leetcode572.另一个树的子树

最新推荐文章于 2024-11-14 23:35:31 发布

sun20180413

最新推荐文章于 2024-11-14 23:35:31 发布

阅读量106

点赞数 1

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/sun20180413/article/details/105965410

版权

leetcode 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

1.DFS比较

2.将树转成字符串将问题转换成判断一个字符串是否是另一个字符串的字串

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def equaltree(self,s,t):
        if not s and not t:
            return True
        if not s or not t:
            return False
        return s.val==t.val and self.equaltree(s.left,t.left) and self.equaltree(s.right,t.right)
    def isSubtree(self, s: TreeNode, t: TreeNode) -> bool:
        if not s and not t:
            return True
        if not s or not t:
            return False
        return self.equaltree(s,t) or self.isSubtree(s.left,t) or self.isSubtree(s.right,t)

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def treetostring(self,s):
        if not s:
            return '$'
        return '*'+str(s.val)+self.treetostring(s.left)+self.treetostring(s.right)
    def isSubtree(self, s: TreeNode, t: TreeNode) -> bool:
        if not s and not t:
            return True
        if not s or not t:
            return False
        sstring=self.treetostring(s)
        tstring=self.treetostring(t)
        return tstring in sstring