# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def isSameTree(self, p, q): #是否是相同的树
"""
:type p: TreeNode
:type q: TreeNode
:rtype: bool
"""
leftsame=True;
rifhtsame=True;
if p is None and q is None:
return True
elif (p is None and q is not None) or (q is None and p is not None):
return False
elif p.val != q.val:
return False
leftsame = self.isSameTree(p.left,q.left)
rifhtsame = self.isSameTree(p.right,q.right)
return leftsame and rifhtsame
【leetcode】100. Same Tree
最新推荐文章于 2022-08-07 00:34:38 发布