[leetcode_228] Summary Ranges

简单的模拟题,合并区间

 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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
class Solution {
public:
    string convertIntToStr(int num)
    {
        char str[255];
        sprintf(str, "%d", num);
        return str;
    }

    vector<string> summaryRanges(vector<int>& nums) {
        vector<string> ranges;
        ranges.clear();
        if (nums.size() <= 0)
        {
            return ranges;
        }
        int start = nums[0];
        int end = nums[0];
        for (int i = 1;i < nums.size(); i++)
        {
            if (nums[i] - nums[i-1] == 1)
            {
                end = nums[i];
            }
            else
            {
                string item = convertIntToStr(start);
                if (end == start)
                {
                    ranges.push_back(item);
                }
                else
                {
                    item += "-";
                    item += convertIntToStr(end);
                    ranges.push_back(item);
                }
                start = nums[i];
                end = start;
            }
        }
        string item = convertIntToStr(start);
        if (end == start)
        {
            ranges.push_back(item);
        }
        else
        {
            item += "-";
            item += convertIntToStr(end);
            ranges.push_back(item);
        }
        return ranges;
    }
};
Licensed under CC BY-NC-SA 4.0