zoukankan      html  css  js  c++  java
  • 树的子结构 牛客网 剑指Offer

    树的子结构 牛客网 剑指Offer

    • 题目描述
    • 输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
    # class TreeNode:
    #     def __init__(self, x):
    #         self.val = x
    #         self.left = None
    #         self.right = None
    class Solution:
        #run:27ms memory:5612k
        def HasSubtree(self, pRoot1, pRoot2):
            ret = False
            if pRoot2 is None or pRoot1 is None:
                return ret 
            if pRoot1.val == pRoot2.val:
                ret  = self.doesTree1HasTree2(pRoot1,pRoot2)
            if ret == False:
                ret = self.HasSubtree(pRoot1.left,pRoot2)
            if ret == False:
                ret = self.HasSubtree(pRoot1.right,pRoot2)
            return  ret 
        
        def doesTree1HasTree2(self,pRoot1,pRoot2):
            if pRoot2 == None:
                return True
            if pRoot1 == None:
                return False
            if pRoot1.val != pRoot2.val:
                return False
            return self.doesTree1HasTree2(pRoot1.left,pRoot2.left) and self.doesTree1HasTree2(pRoot1.right,pRoot2.right)
  • 相关阅读:
    7.数组的扩展
    8.对象的扩展
    6.函数的扩展
    5.数值的扩展
    2.变量的解构赋值
    1.let 和 const 命令
    CTE(With As)
    delphi使用ADO在sql数据库存取图片的方法
    使用Razor生成Word
    Redis基础总结
  • 原文地址:https://www.cnblogs.com/vercont/p/10210364.html
Copyright © 2011-2022 走看看