给定一个排序的整数数组 nums ,其中元素的范围在 闭区间 [lower, upper] 当中,返回不包含在数组中的缺失区间。
示例:
输入: nums = [0, 1, 3, 50, 75], lower = 0 和 upper = 99,
输出: [“2”, “4->49”, “51->74”, “76->99”]
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
/**
* @PackageName: PACKAGE_NAME
* @ClassName: Test08
* @Author:
* @Date: 2020/4/16 10:26
* @Description: //TODO
*/
public class Test08 {
public static void main(String[] args) {
/*For example, given [0, 1, 3, 50, 75], lower = 0 and upper = 99,
return ["2", "4->49", "51->74", "76->99"]*/
int[] arr = {
-5,-1,0,31, 3, 50, 75,101,99};
int lower=0;
int upper=99;
List<String> MissingRange = findMissingRanges(arr