forked from keon/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy pathMissingRanges.scala
42 lines (31 loc) · 880 Bytes
/
MissingRanges.scala
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
package algorithms.array
import scala.collection.mutable.ListBuffer
/**
* find missing ranges between low and high in the given array.
* ex) [3, 5] lo=1 hi=10 => answer: [1->2, 4, 6->10]
*/
object MissingRanges {
def apply(list: List[Int], lo: Int, hi: Int): List[String] = {
if (lo >= hi) throw new IllegalArgumentException(s"Invalid range [$lo, $hi]")
val source = list.sorted
var missingRanges = ListBuffer[String]()
var start = lo
for (v <- source) {
if (v > start) {
missingRanges += getRange(start, v - 1)
}
start = v + 1
}
if (start <= hi) {
missingRanges += getRange(start, hi - 1)
}
missingRanges.toList
}
private[this] def getRange(start: Int, end: Int): String = {
if (start == end) {
start.toString
} else {
start.toString + "->" + end.toString
}
}
}