Python題解
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def HasSubtree(self, pRoot1, pRoot2):
def Equal(num1, num2):
if (num1 - num2 > -0.0000001) and (num1 - num2 < 0.0000001):return True
else:return False
def DoesTree1HasTree2(pRoot1, pRoot2):
if not pRoot2:return True
if not pRoot1:return False
if not Equal(pRoot1.val, pRoot2.val):return False
return DoesTree1HasTree2(pRoot1.left, pRoot2.left) and \
DoesTree1HasTree2(pRoot1.right, pRoot2.right)
result = False
if pRoot1 != None and pRoot2 != None:
if Equal(pRoot1.val, pRoot2.val):
result = DoesTree1HasTree2(pRoot1, pRoot2)
if not result:
result = self.HasSubtree(pRoot1.left, pRoot2)
if not result:
result = self.HasSubtree(pRoot1.right, pRoot2)
return result
考點
- 考查對二叉樹遍歷算法的理解及遞歸編程能力;
- 考查所寫代碼的魯棒性,需要採用防禦性編程的方式,每次訪問指針地址都應考慮這個指針有沒有可能是空。