题目:
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"].
给定一个已经排好序且没有重复数子的整数数组,返回它的范围总结,即将相邻的一组数据用区间表示。
思路:
维持两个变量,一个开头一个结束,对数组元素进行轮训,连续就结束符后移,不连续就放到结果集中。
代码:0ms
class Solution { public: vector<string> summaryRanges(vector<int>& nums) { vector<string> result; if(nums.size()<1){ return result; } int begin = nums[0]; int end = nums[0]; for(int i=1; i<nums.size(); i++){ if(nums[i]==end || nums[i] == end+1){ end = nums[i]; }else{ if(begin == end){ result.push_back(to_string(begin)); }else{ string s = to_string(begin) + "->" + to_string(end); result.push_back(s); } begin = end = nums[i]; } } if(begin == end){ result.push_back(to_string(begin)); }else{ string s = to_string(begin) + "->" + to_string(end); result.push_back(s); } return result; } };代码:0ms
class Solution { public: vector<string> summaryRanges(vector<int>& nums) { vector<string> result; if(nums.size()==1){ result.push_back(to_string(nums[0])); return result; } for(int i=0; i<nums.size(); i++){ int a = nums[i]; while(i+1<nums.size() && (nums[i+1]-nums[i])==1){ i++; } if(a!=nums[i]){ string s = to_string(a) + "->" + to_string(nums[i]); result.push_back(s); }else{ result.push_back(to_string(a)); } } return result; } };
代码:0ms
class Solution { public: vector<string> summaryRanges(vector<int>& nums) { vector<string> ret; int begin = 0; for(int i = 0; i < nums.size(); i++){ if(i + 1 == nums.size() || nums[i] + 1 != nums[i+1]){ string tmp = to_string(nums[begin]); if(i != begin) tmp += "->" + to_string(nums[i]); ret.push_back(tmp); begin = i + 1; } } return ret; } };