Missing Ranges

Missing Ranges

Given a sorted integer array where the range of elements are [lower, upper] inclusive, 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"].

two pointers: prev and cur.

0, 1,3,50,75 lower = 0, upper = 99

1. prev = lower - 1      cur = nums[0]=0

2. prev = nums[0] = 0  cur = nums[1] 

......

public class Solution {
    public List<String> findMissingRanges(int[] nums, int lower, int upper) {
        List<String> ret = new ArrayList<String>();
        if (nums == null)
            return ret;
        
        int prev = lower - 1;
        int cur = 0;
        for (int i = 0; i <= nums.length; i++) {
            cur = (i == nums.length) ? upper + 1 : nums[i];
            
            if ((cur - prev) >= 2) {
                ret.add(range(prev + 1, cur - 1));
            }
            
            prev = cur;
        }
        
        return ret;
    }
    
    
    private String range(int from, int to) {
        if (from == to)
            return String.valueOf(from);
        
        else
            return from + "->" + to;
    }
}