-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
228.cpp
57 lines (57 loc) · 1.6 KB
/
228.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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
__________________________________________________________________________________________________
sample 4 ms submission
class Solution {
public:
vector<string> summaryRanges(vector<int>& nums) {
vector<string>ret;
if(nums.empty())
return ret;
int cur = nums[0];
for(int i = 0;i<nums.size();i++){
int cur = nums[i];
int nex= nums[i];
string range = to_string(cur);
while(i+1<nums.size() && nums[i+1] == nex+1){
i++;
nex = nums[i];
}
if(cur == nex)
ret.push_back(range);
else
ret.push_back(range + "->"+to_string(nex));
}
return ret;
}
};
__________________________________________________________________________________________________
sample 8384 kb submission
class Solution {
private:
string encode(int low, int high) {
if (low == high) {
return to_string(low);
}
return to_string(low) + "->" + to_string(high);
}
public:
vector<string> summaryRanges(vector<int>& nums) {
if (nums.empty()) {
return vector<string>();
}
int low = nums[0];
int high = nums[0];
vector<string> result;
for (int i = 1; i < nums.size(); ++i) {
if (nums[i] != (high + 1)) {
result.push_back(encode(low, high));
low = nums[i];
high = nums[i];
} else {
high = nums[i];
}
}
result.push_back(encode(low, high));
return result;
}
};
__________________________________________________________________________________________________