LeetCode Summary Ranges (统计有序数列范围)

 1 class Solution {
 2 public:
 3     vector<string> summaryRanges(vector<int>& nums) {
 4         if(nums.empty())    return vector<string>();
 5         vector<string> vect;
 6         for(int i=0; i<nums.size(); i++)
 7         {
 8             int s=nums[i], e;
 9             while(i+1<nums.size()&&nums[i]+1==nums[i+1])    i++;
10             e=nums[i];
11             if(s<e) vect.push_back(to_string(s)+"->"+to_string(e));
12             else    vect.push_back(to_string(s));
13         }
14         return vect;
15     }
16 };