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

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

解答：

直接进行线性遍历即可，注意判断起始和结束是否相等

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        vector<string> res;
        for(int i = 0; i < nums.size(); i++){
            int s = nums[i], e = nums[i];
            while(i < nums.size() - 1 && nums[i] + 1== nums[i+1]) i++;
            e = nums[i];
            if(s != e) res.push_back(to_string(s) + "->" + to_string(e));
            else res.push_back(to_string(s));
        }
        return res;
    }
};