LeetCode 228. Summary Ranges

最新推荐文章于 2020-12-29 22:43:47 发布

katrina95

最新推荐文章于 2020-12-29 22:43:47 发布

阅读量99

点赞数

分类专栏：计算机算法

本文链接：https://blog.csdn.net/katrina95/article/details/85999781

版权

计算机算法专栏收录该内容

221 篇文章 0 订阅

订阅专栏

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.

重点在于，用start = nums[0]来表示每次要group的第一个数，然后iterate,当需要group的时候group一下，再更新start. 用一个group函数来写更好：public String group(int start, int end) {if (start == end){…} else{…} )

    public List<String> summaryRanges(int[] nums) {
        List<String> res = new ArrayList<>();
        if (nums.length == 0) return res;
        if (nums.length == 1) {res.add(""+nums[0]); return res;}
        StringBuilder sb = new StringBuilder();
        int start = nums[0];
        for (int i = 0; i < nums.length - 1; i++) {
            if (nums[i] + 1 != nums[i+1]) {
                if (start != nums[i]) sb.append(start).append("->").append(nums[i]);
                else sb.append(start);
                res.add(sb.toString());
                start = nums[i+1];
                sb = new StringBuilder();
            } 
            if (i == nums.length - 2) {
                if (nums[i] +1 != nums[i+1]) {
                    res.add(""+nums[i+1]);
                } else {
                    sb.append(start).append("->").append(nums[i+1]);
                    res.add(sb.toString());
                }
            }
        }
        return res;
    }

public List<String> summaryRanges(int[] nums) {
    //special case 
    List<String> res = new ArrayList<>();
    if (nums.length == 0) return res;
    //base case
    int start = nums[0];
    //general case
    for (int i = 1; i < nums.length; i++) {
        if (nums[i] != nums[i - 1] + 1) {
            group(res, start, nums[i - 1]);
            start = nums[i];
        }
    }
    group(res, start, nums[nums.length - 1]);
    return res;
}
public void group(List<String> res, int start, int end) {
    StringBuilder sb = new StringBuilder();
    if (start == end) {
        sb.append(start);
    } else {
        sb.append(start);
        sb.append("->");
        sb.append(end);
    }
    res.add(sb.toString());
}