[leetcode] 228. Summary Ranges 解题报告

 题目链接：https://leetcode.com/problems/summary-ranges/

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"].

思路：这是让求一个数组的连续区间，作为这种需要处理字符和整数之间转换的题目很容出错，并且很难把代码写的优雅。

代码如下：

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        if(nums.size()==0) return {};
        nums.push_back(nums.back());
        vector<string> ans;
        for(int i = 1, left=0, cur=nums[0]; i < nums.size(); i++)
        {
            if(cur+1==nums[i]) cur++;
            else
            {
                string str = to_string(nums[left]);
                if(i-left>1) str += "->" +to_string(nums[i-1]);
                ans.push_back(str);
                left = i, cur = nums[i];
            }
        }
        return ans;
    }
};