[leetcode] Summary Ranges

From : 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) {
        vector<string> ans;
        for(int i=0, sz=nums.size(); i<sz; i++) {
			string cur = to_string(nums[i]);
            int d=i;
            for(int j=i+1; j<sz; j++) {
                if(nums[j-1]+1 == nums[j]) {
                    d = j;
                } else {
                    break;
                }
            }
            if(d != i) {
                cur += "->" + to_string(nums[d]);
            }
            i = d;
            ans.push_back(cur);
        }
        return ans;
    }
};