leetcode之Path Sum

# 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 hasPathSum(self, root, sum):
"""
:type root: TreeNode
:type sum: int
:rtype: bool
"""
pathlist = []
def showpath(list1, root):
if not root:
return []
list2 = list1[::]
if list2 == []:
list2.append(root.val)
else:
list2.append(root.val)
if not root.left and not root.right:
pathlist.append(list2)
else:
if root.left:
list1 = list2
showpath(list1, root.left)
if root.right:
list1 = list2
showpath(list1, root.right)
return pathlist
s =  showpath([], root)
pathlist1 = []
if s == []:
return False
for i in s:
sumofall = 0
for j in i:
sumofall += j
if sumofall == sum:
return True
else:
return False