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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
| import Foundation
public class MyTreeNode {
public var val: Int
public var children: [MyTreeNode]?
public init(_ val: Int) {
self.val = val
self.children = nil
}
}
class For50Solution {
func commonTreeNode(_ root: MyTreeNode,_ a: MyTreeNode,_ b: MyTreeNode) -> MyTreeNode? {
var list1 = [MyTreeNode]()
var list2 = [MyTreeNode]()
getNodePath(root, a, &list1)
getNodePath(root, b, &list2)
return getLastCommonNode(list1, list2)
}
func getNodePath(_ root: MyTreeNode?,_ p: MyTreeNode,_ list: inout [MyTreeNode]) {
if root!.val == p.val {
return
}
list.append(root!)
let arr = root!.children
if arr != nil {
for node in arr! {
if node.val == p.val {
list.append(node)
break
}
getNodePath(node, p, &list)
}
}
if list.last?.val != p.val {
list.removeLast()
}
}
func getLastCommonNode(_ p1: [MyTreeNode],_ p2: [MyTreeNode]) -> MyTreeNode? {
var temp: MyTreeNode? = nil
var index = 1
while index < p1.count {
if p1[index].val == p2[index].val {
temp = p1[index]
break
}
index += 1
}
return temp
}
}
|
