-
Notifications
You must be signed in to change notification settings - Fork 0
/
112.py
37 lines (28 loc) · 842 Bytes
/
112.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#!/usr/bin/env python
# -*- coding: utf-8 -*-
__author__ = ['"wuyadong" <[email protected]>']
# 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
"""
if root is None:
return False
if root.left is None and root.right is None:
if sum == root.val:
return True
else:
return False
if root.left and self.hasPathSum(root.left, sum-root.val):
return True
if root.right and self.hasPathSum(root.right, sum-root.val):
return True
return False