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”].
将所给数组连成串并输出,简单题:
解题思路:遍历数组,用start、end记录每段数字串的开头及结尾,当start!=end时,以start->end形式保存,否则以单个数值start保存,实现如下:
vector<string> summaryRanges(vector<int>& nums) {
int n = nums.size();
vector<string> res;
if(0 == n)return res;
for(int i = 0;i<n;){
int start = i;
int end = i;
while(end < n-1 && nums[end+1] == nums[end] + 1) end++;
if(start != end){
res.push_back(to_string(nums[start]) + "->" + to_string(nums[end]));
} else {
res.push_back(to_string(nums[start]));
}
i = end+1;
}
return res;
}