leetcode-228. Summary Ranges-Java

You are given a sorted unique integer array nums.
Return the smallest sorted list of ranges that cover all the numbers in the array exactly. That is, each element of nums is covered by exactly one of the ranges, and there is no integer x such that x is in one of the ranges but not in nums.
Each range [a,b] in the list should be output as:

“a->b” if a != b
“a” if a == b

Example 1:

Input: nums = [0,1,2,4,5,7]
Output: [“0->2”,“4->5”,“7”]
Explanation: The ranges are:
[0,2] --> “0->2”
[4,5] --> “4->5”
[7,7] --> “7”

Example 2:

Input: nums = [0,2,3,4,6,8,9]
Output: [“0”,“2->4”,“6”,“8->9”]
Explanation: The ranges are:
[0,0] --> “0”
[2,4] --> “2->4”
[6,6] --> “6”
[8,9] --> “8->9”

Example 3:

Input: nums = []
Output: []

Example 4:

Input: nums = [-1]
Output: ["-1"]

Example 5:

Input: nums = [0]
Output: [“0”]

大致意思就是给一组数，连续的数转换成 "x1->x2"格式，不连续的就只是"X"这种格式，返回一个List

public class SummaryRanges {
    public List<String> summaryRanges(int[] nums) {
        List<String> ansList = new ArrayList<>();
        StringBuilder builder = new StringBuilder();
        if (nums.length == 0) return ansList;
        int start = nums[0];
        int last = start;

        for (int i = 1; i < nums.length; i++) {
            if (nums[i] - last == 1) {
                last = nums[i];
                continue;
            }
            if (start == last) {
                builder.append(start);
            } else {
                builder.append(start);
                builder.append("->");
                builder.append(last);
            }
            start = nums[i];
            last = start;
            ansList.add(builder.toString());
            builder.setLength(0);
        }
        //添加最后一组
        if (start == last) {
            builder.append(start);
        } else {
            builder.append(start);
            builder.append("->");
            builder.append(last);
        }
        ansList.add(builder.toString());
        return ansList;
    }