LeetCode-228. Summary Ranges

Description

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.

Solution 1(C++)

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        vector<string> res;
        for(int i=0; i<nums.size(); i++){
            string temp = to_string(nums[i]);
            int j=0;
            for(; nums[i+j+1]-nums[i+j]==1 && i+j<nums.size()-1; j++){}
            if(j>0) temp += "->"+to_string(nums[i+j]);
            i+=j;
            res.push_back(temp);
        }
        return res;
    }
};

算法分析

略。

程序分析

略。