【当前无排名】挑战leetcode进入前1w名

李恒道

https://leetcode.cn/problems/summary-ranges/submissions/573763991/?envType=study-plan-v2&envId=top-interview-150
简单题，收工

var summaryRanges = function (nums) {
    if (nums.length == 1) {
        return ["" + nums[0]]
    }
    const result = []
    nums.push("")
    let startNum = nums[0];
    let endNum = nums[0]
    for (let index = 1; index < nums.length; index++) {
        const num = nums[index];
        if (num == endNum + 1) {
            endNum = endNum + 1
        } else {
            result.push(startNum == endNum ? "" + endNum : startNum + "->" + endNum)
            startNum = nums[index]
            endNum = nums[index]
        }
    }
    return result
};