-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMissingRanges.java
59 lines (49 loc) · 1.75 KB
/
MissingRanges.java
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
import java.util.ArrayList;
import java.util.List;
public class MissingRanges {
public static void main(String[] args) {
int lower = 0;
int upper = 99;
int[] nums = {0,1,3,50,75};
System.out.println(findMissingRanges(nums, lower, upper));
}
public static List<String> findMissingRanges(int[] nums, int lower, int upper) {
List<String> result = new ArrayList<String>();
if (nums.length == (upper - lower + 1)) {
return result;
}
if (nums.length == 0) {
if (lower == upper) {
result.add(Integer.toString(lower));
return result;
} else {
result.add(Integer.toString(lower) + "->" + Integer.toString(upper));
return result;
}
}
if (nums[0] != lower) {
if (nums[0] - 1 == lower) {
result.add(Integer.toString(lower));
} else {
result.add(Integer.toString(lower) + "->" + Integer.toString(nums[0]-1));
}
}
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i+1] != (nums[i] + 1)) {
if (nums[i+1] - nums[i] > 2) {
result.add(Integer.toString(nums[i]+1) + "->" + Integer.toString(nums[i+1]-1));
} else {
result.add(Integer.toString(nums[i]+1));
}
}
}
if (nums[nums.length - 1] != upper) {
if (nums[nums.length - 1] + 1 == upper) {
result.add(Integer.toString(upper));
} else {
result.add(Integer.toString(nums[nums.length - 1]+1) + "->" + Integer.toString(upper));
}
}
return result;
}
}