forked from yubinbai/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
35 lines (35 loc) · 1.16 KB
/
Solution.java
File metadata and controls
35 lines (35 loc) · 1.16 KB
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
import java.util.*;
public class Solution {
public List<String> findMissingRanges(int[] vals, int start, int end) {
ArrayList<String> ret = new ArrayList<String>();
String first = validRange(start - 1, vals[0]);
if (first != null) ret.add(first);
for (int i = 1; i < vals.length; ++i) {
String curr = validRange(vals[i - 1], vals[i]);
if (curr != null) ret.add(curr);
}
String last = validRange(vals[vals.length - 1], end + 1);
if (last != null) ret.add(last);
return ret;
}
public String validRange(int a, int b) {
if (b - a > 1) {
int left = a + 1;
int right = b - 1;
if (left == right) {
return String.format("%d", left);
} else {
return String.format("%d->%d", left, right);
}
} else {
return null;
}
}
public static void main(String[] args) {
Solution s = new Solution();
List<String> sa = s.findMissingRanges(new int[] {0, 1, 3, 50, 75}, 0, 99);
for (String str : sa) {
System.out.println(str);
}
}
}