【Java】【LeetCode】228. Summary Ranges

题目：

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.

题解：

s 是start index, e是end index. 看后一个数是否是前一个数加一，是就移动e, 不是就要加结果。加结果时分类讨论, s==e 和 s!=e加法不同。

Time Complexity: O(nums.length). Space: O(n), n是res的大小。

代码：

import java.util.ArrayList;
import java.util.List;

public class SummaryRanges {

    public static void main(String[] args) {
        /**
         * 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.
         */
        int[] nums1 = { 0, 1, 2, 4, 5, 7 };
        System.out.println(summaryRanges(nums1));
        /**
         * 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.
         */
        int[] nums2 = { 0, 2, 3, 4, 6, 8, 9 };
        System.out.println(summaryRanges(nums2));

    }

    public static List<String> summaryRanges(int[] nums) {
        List<String> res = new ArrayList<String>();
        if (nums == null || nums.length == 0) {
            return res;
        }

        int s = 0;
        int e = 0;
        while (e < nums.length) { // error
            if (e < nums.length - 1 && nums[e] + 1 == nums[e + 1]) {
                e++;
            } else {
                if (s == e) {
                    res.add(String.valueOf(nums[s]));
                } else {
                    res.add(String.valueOf(nums[s]) + "->" + String.valueOf(nums[e]));
                }

                e++;
                s = e;
            }
        }

        return res;
    }

}