228. [LeetCode] Summary Ranges

Given a sorted integer array without duplicates, return the summary of its ranges.

Example 1:

Input:  [0,1,2,4,5,7]
Output: ["0->2","4->5","7"]
Explanation: 0,1,2 form a continuous range; 4,5 form a continuous range.

Example 2:

Input:  [0,2,3,4,6,8,9]
Output: ["0","2->4","6","8->9"]
Explanation: 2,3,4 form a continuous range; 8,9 form a continuous range.

---

---

class Solution {
public:
       vector<string> summaryRanges(vector<int>& nums) {
    const int size_n = nums.size();
    vector<string> res;
    if (  == size_n) return res;
    for (int i = ; i < size_n;) {
        int start = i, end = i;
        while (end +  < size_n && nums[end+] == nums[end] + ) end++;
        if (end > start) res.push_back(to_string(nums[start]) + "->" + to_string(nums[end]));
        else res.push_back(to_string(nums[start]));
        i = end+;
    }
    return res;
}
};

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        vector<string> result;
        if(!nums.size()) return result;
    int low = nums[], high = nums[];
    for(int i = ; i < nums.size(); i++){
        if (nums[i] == high + )
            high++;
        else{
            result.push_back(low == high ? to_string(low) : to_string(low) + "->" + to_string(high));
            low = high = nums[i];
        }
    }
    result.push_back(low == high ? to_string(low) : to_string(low) + "->" + to_string(high));
    return result;
    }
};