228. 汇总区间 - 力扣（LeetCode） 遍历就完事了，没啥好说的
class Solution { public: vector<string> res; vector<string> summaryRanges(vector<int>& nums) { int l = 0, r = l, n = nums.size(); while(r < n){ while(r < n-1 && nums[r+1] == nums[r] + 1) ++r; if(r > l) res.push_back(to_string(nums[l]) + "->" + to_string(nums[r])); else res.push_back(to_string(nums[l])); l = r+1; r = l; } return res; } };