［Leetcode刷題］Summary Ranges —— javascript

Given a sorted integer array without duplicates, return the summary of its ranges.

For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].

輸入一個排序好的整數數組，輸出數組中連續數字的範圍的數組

/**
 * @param {number[]} nums
 * @return {string[]}
 */
var summaryRanges = function(nums) {
    let rst = [],
        tem = nums[0];
    nums.map((num, i) => {
        if (nums[i+1] - num !== 1) {
           num === tem ? rst.push(`${num}`): rst.push(`${tem}->${num}`);
           tem = nums[i+1]  
        }
    });
    return rst;
};

這是個人解法，不知道有沒有有更好更快的實現