-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathSolution.kt
88 lines (74 loc) · 2.03 KB
/
Solution.kt
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
/**
* Created by Inno Fang on 2018/2/10.
*/
import java.util.*
class TreeNode(var `val`: Int = 0) {
var left: TreeNode? = null
var right: TreeNode? = null
}
/**
* 34 / 34 test cases passed.
* Status: Accepted
* Runtime: 417 ms
*/
class Solution {
fun levelOrder(root: TreeNode?): List<List<Int>> {
val res = ArrayList<ArrayList<Int>>()
if (root == null) return res
val que = LinkedList<TreeNode>()
que.add(root)
var start = 0
var end = que.size
var level = ArrayList<Int>()
while (que.isNotEmpty()) {
val node = que.poll()
level.add(node.`val`)
if (node.left != null) que.add(node.left!!)
if (node.right != null) que.add(node.right!!)
start++
if (start == end) {
end = que.size
start = 0
res.add(level)
level = ArrayList()
}
}
return res
}
}
/**
* 34 / 34 test cases passed.
* Status: Accepted
* Runtime: 339 ms
*/
class Solution2 {
fun levelOrder(root: TreeNode?): List<List<Int>> {
val res = ArrayList<ArrayList<Int>>()
if (root == null) return res
val que = LinkedList<Pair<TreeNode, Int>>()
que.add(Pair(root, 0))
while (que.isNotEmpty()) {
val node = que.peek().first
val level = que.peek().second
que.poll()
if (level == res.size)
res.add(ArrayList())
res[level].add(node.`val`)
node.left?.let { que.add(Pair(it, level + 1)) }
node.right?.let { que.add(Pair(it, level + 1)) }
}
return res
}
}
fun main(args: Array<String>) {
val root = TreeNode(3)
val node1 = TreeNode(9)
val node2 = TreeNode(20)
val node3 = TreeNode(15)
val node4 = TreeNode(7)
root.left = node1
root.right = node2
node2.left = node3
node2.right = node4
Solution2().levelOrder(root).forEach { it.forEach { print("$it ") }; println() }
}