-
Notifications
You must be signed in to change notification settings - Fork 0
/
0113-path-sum-ii.swift
40 lines (36 loc) · 1.1 KB
/
0113-path-sum-ii.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
32
33
34
35
36
37
38
39
40
/**
* 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 pathSum(_ root: TreeNode?, _ targetSum: Int) -> [[Int]] {
guard let root else {
return []
}
if root.left == nil, root.right == nil, root.val == targetSum {
return [[root.val]]
}
var result = [[Int]]()
for child in [root.left, root.right] {
if let child {
let paths = pathSum(child, targetSum - root.val)
for path in paths {
var copy = path
result.append([root.val] + path)
}
}
}
return result
}
}