leetcode

0 class Solution {

1 public:

2 vector<string> summaryRanges(vector<int> &nums) {

3 if (!nums.size()) return {};

4 vector<string> res;

5 int start = 0;

6 for (int i = 1; i < nums.size(); i++) {

7 if (nums[i] == nums[i - 1] + 1) continue;

8 if (i - start > 1)

9 res.push_back(to_string(nums[start]) + "->" + to_string(nums[i - 1]));

10 else

11 res.push_back(to_string(nums[start]));

12 start = i;

13 }

14 if (nums.size() - start > 1)

15 res.push_back(to_string(nums[start]) + "->" + to_string(nums.back()));

16 else

17 res.push_back(to_string(nums[start]));

18

19 return res;

20 }

21 };