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

思想很简单 逐个比较前后两个数的差值。

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        vector<string> res ;
        if(nums.size()<1 ) return res;
        int i = 0;
        int n = nums.size();
        while(i<n)
        {
            int j = 1;
            while(i+j<n && nums[i] == nums[i+j]-j)    ++j;
            res.push_back(j<=1?to_string(nums[i]):to_string(nums[i])+"->"+to_string(nums[i+j-1])); 
            i = i + j;
        }
        return res;
    }
};