-
Notifications
You must be signed in to change notification settings - Fork 0
/
112_path_sum.swift
31 lines (31 loc) · 1.05 KB
/
112_path_sum.swift
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
/**
* Definition for a binary tree node.
* public class TreeNode {
* public var val: Int
* public var left: TreeNode?
* public var right: TreeNode?
* public init() { self.val = 0; self.left = nil; self.right = nil; }
* public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }
* public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {
* self.val = val
* self.left = left
* self.right = right
* }
* }
*/
class Solution {
func hasPathSum(_ root: TreeNode?, _ targetSum: Int) -> Bool {
return getSum(root, 0, targetSum)
}
func getSum(_ node: TreeNode?, _ currentSum: Int, _ targetSum: Int) -> Bool {
guard let n = node else { return false }
if n.left == nil && n.right == nil {
if currentSum + n.val == targetSum {
return true
} else {
return false
}
}
return getSum(n.left, currentSum+n.val, targetSum) || getSum(n.right, currentSum+n.val, targetSum)
}
}