Question:
Given a sorted integer array without duplicates, return the summary of its ranges.
For example, given [0,1,2,4,5,7]
, return ["0->2","4->5","7"].
总结顺序数组的范围.
代码如下:
<span style="font-size:14px;">class Solution {
public:
vector<string> summaryRanges(vector<int>& nums) {
vector<string> result;
int start;
if(nums.empty())
return result;
if(nums.size() == 1){
result.push_back(to_string(nums[0]));
return result;
}
start = 0;
for(int i = 0; i < nums.size()-1; ++i){
if(nums[i]+1 != nums[i+1]){
if(start != i){
result.push_back(to_string(nums[start])+"->"+to_string(nums[i]));
}
else{
result.push_back(to_string(nums[i]));
}
start = i+1;
}
else{
if(i == nums.size()-2){
result.push_back(to_string(nums[start])+"->"+to_string(nums[i+1]));
}
}
if(start == nums.size()-1)
result.push_back(to_string(nums[start]));
}
return result;
}
};</span>