-
Notifications
You must be signed in to change notification settings - Fork 28
/
Copy pathMissing_Ranges.cpp
36 lines (32 loc) · 1.05 KB
/
Missing_Ranges.cpp
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
class Solution {
void output(int lower, int upper, vector<string>& result) {
if(upper == lower) {
result.push_back(to_string(lower));
} else {
result.push_back(to_string(lower) + "->" + to_string(upper));
}
}
public:
vector<string> findMissingRanges(vector<int>& nums, int lower, int upper) {
vector<string> result;
// case: array empty, both lower and upper inclusive
if(nums.empty()) {
output(lower, upper, result);
return result;
}
// case: lower inclusive
if(nums[0] - lower > 0) {
output(lower, nums[0] - 1, result);
}
for(int i = 1; i < nums.size(); ++i) {
if(nums[i] - nums[i - 1] > 1) {
output(nums[i - 1] + 1, nums[i] - 1, result);
}
}
// case: upper inclusive
if(upper - nums[nums.size() - 1] > 0) {
output(nums[nums.size() - 1] + 1, upper, result);
}
return result;
}
};