228. 汇总区间（javascript）228. Summary Ranges

题目来自：https://leetcode-cn.com/problems/summary-ranges/

给定一个无重复元素的有序整数数组 nums
You are given a sorted unique integer array nums.

返回 恰好覆盖数组中所有数字 的 最小有序 区间范围列表。也就是说，nums 的每个元素都恰好被某个区间范围所覆盖，并且不存在属于某个范围但不属于 nums 的数字 x 。

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.

列表中的每个区间范围 [a,b] 应该按如下格式输出：

“a->b” ，如果 a != b
“a” ，如果 a == b

Each range [a,b] in the list should be output as:

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

示例 1：

输入：nums = [0,1,2,4,5,7]
输出：["0->2","4->5","7"]
解释：区间范围是：
[0,2] --> "0->2"
[4,5] --> "4->5"
[7,7] --> "7"

示例 2：

输入：nums = [0,2,3,4,6,8,9]
输出：["0","2->4","6","8->9"]
解释：区间范围是：
[0,0] --> "0"
[2,4] --> "2->4"
[6,6] --> "6"
[8,9] --> "8->9"

示例 3：

输入：nums = []
输出：[]

示例 4：

输入：nums = [-1]
输出：["-1"]

示例 5：

输入：nums = [0]
输出：["0"]

/**
 * @param {number[]} nums
 * @return {string[]}
 */
var summaryRanges = function(nums) {
	//将三种特殊情况先列出来
    if(nums==[]){return []}
    if(nums==[-1]){return ["-1"]}
    if(nums==[0]){return ["0"]}
    //先创建一个空数组
    var newList=[];
    //遍历nums索引
    for(let i =0;i<nums.length;i++){
        let index=i;
        let tempt=nums[i];
        //nums[index+1]==nums[index]+1
        while (index+1<nums.length &&nums[index+1]==nums[index]+1){
            index++;
        }
        //"a" ，if a == b
        if (index==i){
            newList.push(nums[i]+'');
         //"a->b" if a != b
        }else{
            newList.push(nums[i]+'->'+nums[index]);
            i=index;
        }  
    }
    return newList;
};