163. Missing Ranges

Given a sorted integer array where the range of elements are in the inclusive range [lower, upper], return its missing ranges.

For example, given [0, 1, 3, 50, 75], lower = 0 and upper = 99, return ["2", "4->49", "51->74", "76->99"].

题目很好理解，不过有一个测试实例需要注意，防止越界。

Input:
[-2147483648,-2147483648,0,2147483647,2147483647]
-2147483648
2147483647
Output:
["-2147483647->-1","1->2147483646","-2147483648->2147483646"]
Expected:
["-2147483647->-1","1->2147483646"]

思路是先判断lower跟nums[0]，再判断nums[1]到nums[n-1]，最后判断nums[n-1]和upper。如果nums为空，不是返回空，是返回[lower->upper]。代码如下：

public class Solution {
    public List<String> findMissingRanges(int[] nums, int lower, int upper) {
        List<String> res = new ArrayList<String>();
        if (nums.length == 0 || lower > nums[nums.length - 1] || upper < nums[0]) {
            String str = lower + "";
            if (upper > lower) {
                str = str + "->" + (upper);
            }
            res.add(str);
            return res;
        }
        if (nums[0] > lower) {
            String str = lower + "";
            if (nums[0] - 1 > lower) {
                str = str + "->" + (nums[0] - 1);
            }
            res.add(str);
        }
        //System.out.println(res);
        for (int i = 1; i < nums.length; i ++) {
            if (nums[i] > nums[i - 1]) {
                if (nums[i] > nums[i - 1] + 1) {
                    String str = (nums[i - 1] + 1) + "";
                    if (nums[i] - 1 > nums[i - 1] + 1) {
                        str = str + "->" + (nums[i] - 1);
                    }
                    res.add(str);
                }
            }
        }
        //System.out.println(res);
        if (upper > nums[nums.length - 1]) {
            String str = (nums[nums.length - 1] + 1) + "";
            if (upper - 1 > nums[nums.length - 1]) {
                str = str + "->" + (upper);
            }
            res.add(str);
        }
        return res;
    }
}