[Leetcode 228, Easy] Summary Ranges

最新推荐文章于 2024-02-02 18:00:00 发布

simplify2012

最新推荐文章于 2024-02-02 18:00:00 发布

阅读量502

点赞数

分类专栏： Leetcode_easy 文章标签： leetcode search

本文链接：https://blog.csdn.net/u012212811/article/details/46759369

版权

Leetcode_easy 专栏收录该内容

58 篇文章 0 订阅

订阅专栏

Problem:

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"].

Analysis:

Group elements of an array by contiguous increasing.

Solutions:

C++:

    void AddEndPoint(string& s_range, int num)
    {
        if(num == 0) {
            s_range.push_back('0');
            return;
        }

        if(num < 0)
            s_range.push_back('-');
        
        unsigned int u_num = abs(num);
        string s_point;
        while(u_num > 0) {
            int c_digit = u_num % 10;
            u_num /= 10;
            s_point.insert(s_point.begin(), c_digit + '0');
        }
        s_range.append(s_point);
    }

    vector<string> summaryRanges(vector<int>& nums) {
        vector<string> collection_ranges;
        if(nums.empty())
            return collection_ranges;

        for(int i = 0; i < nums.size();) {
            int start_num = nums[i];
            int end_num = nums[i];
            int j = i + 1;
            for(; j < nums.size(); ++j) {
                if(nums[j] - nums[i] != j - i)
                    break;
                end_num = nums[j];
            }
            string s_range;
            AddEndPoint(s_range, start_num);
            if(start_num != end_num) {
                s_range.append("->");
                AddEndPoint(s_range, end_num);
            }
            collection_ranges.push_back(s_range);
            i = j;
        }
        
        return collection_ranges;
    }

Java :

Python: