LeetCode/228.cpp at master · nitin-maharana/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */
class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        vector<string> result;

        if(!nums.size())
            return result;

        int curr = nums[0];
        int index = 0, i;

        for(i = 0; i < nums.size()-1; i++)
        {
            if(nums[i+1] == nums[i] + 1)
                continue;
            else
            {
                if((i - index) > 0)
                    result.push_back(to_string(curr)+"->"+to_string(nums[i]));
                else
                    result.push_back(to_string(curr));
                curr = nums[i+1];
                index = i+1;
            }
        }

        if((i - index) > 0)
            result.push_back(to_string(curr)+"->"+to_string(nums[i]));
        else
            result.push_back(to_string(curr));

        return result;
    }
};