# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def mergeTrees(self, t1, t2):
"""
:type t1: TreeNode
:type t2: TreeNode
:rtype: TreeNode
"""
if t1==None and t2==None:
return None
elif t1==None:
return t2
elif t2==None:
return t1
else:
t = TreeNode(t1.val+t2.val)
t.left=self.mergeTrees(t1.left,t2.left)
t.right=self.mergeTrees(t1.right,t2.right)
return t
自己的方法,简单明了,注意避免使用None.left,会报错。错误代码错误代码错误代码:
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def mergeTrees(self, t1, t2):
"""
:type t1: TreeNode
:type t2: TreeNode
:rtype: TreeNode
"""
if t1==None and t2==None:
return None
elif t1==None:
t = TreeNode(t2.val)
elif t2==None:
t = TreeNode(t1.val)
else:
t = TreeNode(t1.val+t2.val)
t.left=self.mergeTrees(t1.left,t2.left)
t.right=self.mergeTrees(t1.right,t2.right)
return t
另有大神的另外一种写法,思路大概相同:
def mergeTrees(self, t1, t2):
if not t1 and not t2: return None
ans = TreeNode((t1.val if t1 else 0) + (t2.val if t2 else 0))
ans.left = self.mergeTrees(t1 and t1.left, t2 and t2.left)
ans.right = self.mergeTrees(t1 and t1.right, t2 and t2.right)
return ans
这里用到了and操作符,和and语句有区别,用法如下:
- 在不加括号时,and优先级大于or
- x or y 的值在x,y中取,x为真就是x,x为假就是y
- x and y 的值也在x,y中取,x为真就是y,x为假就是x
举本题为例,t1 and t1.left,t1为非None时,取值t1.right;t1为None时,取值为None。
若改为t1 or t1.left,则t1为None时,取t1.left,t1不为None时,取t1。(不过改为or后在这道题中,这句话没有什么价值)