Leetcode #228 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> result; 
        int start, index = 0; 
        while(index < nums.size()){ 
            start = nums[index]; 
            while(++index < nums.size() && nums[index] == nums[index - 1]  + 1); 
            if (start == nums[index - 1]) result.push_back(to_string(start)); 
            else result.push_back(to_string(start) + "->" + to_string(nums[index - 1])); 
        } 
        return result; 
    } 
};