javascript 解法, 执行用时: 56 ms, 内存消耗: 41.1 MB, 提交时间: 2023-08-26 08:34:04

/**
 * @param {number[]} nums
 * @return {string[]}
 */
var summaryRanges = function(nums) {
    const ret = [];
    let i = 0;
    const n = nums.length;
    while (i < n) {
        const low = i;
        i++;
        while (i < n && nums[i] === nums[i - 1] + 1) {
            i++;
        }
        const high = i - 1;
        const temp = ['' + nums[low]];
        if (low < high) {
            temp.push('->');
            temp.push('' + nums[high]);
        }
        ret.push(temp.join(''));
    }
    return ret;
};

java 解法, 执行用时: 0 ms, 内存消耗: 39.5 MB, 提交时间: 2023-08-26 08:33:44

class Solution {
    public List<String> summaryRanges(int[] nums) {
        List<String> ret = new ArrayList<String>();
        int i = 0;
        int n = nums.length;
        while (i < n) {
            int low = i;
            i++;
            while (i < n && nums[i] == nums[i - 1] + 1) {
                i++;
            }
            int high = i - 1;
            StringBuffer temp = new StringBuffer(Integer.toString(nums[low]));
            if (low < high) {
                temp.append("->");
                temp.append(Integer.toString(nums[high]));
            }
            ret.add(temp.toString());
        }
        return ret;
    }
}

golang 解法, 执行用时: 0 ms, 内存消耗: 1.9 MB, 提交时间: 2020-11-20 14:25:21

func summaryRanges(nums []int) []string {
    n := len(nums)
    var ans []string
    if n == 0 {
        return ans
    }
    start, end := nums[0], nums[0]
    for i := 1; i < n; i++ {
        if nums[i] - nums[i-1] == 1 {
            end = nums[i]
        } else {
            ans = append(ans, helper(start, end))
            start = nums[i]
        }
    }
    ans = append(ans, helper(start, end))
    return ans
}

func helper(start, end int) string {
    if start < end {
        return fmt.Sprintf("%d->%d", start, end)
    }
    return fmt.Sprintf("%d", start)
}

golang 解法, 执行用时: 0 ms, 内存消耗: 1.9 MB, 提交时间: 2020-11-20 11:33:29

func summaryRanges(nums []int) []string {
    n := len(nums)
    var ans []string
    if n == 0 {
        return ans
    }
    start, end := nums[0], nums[0]
    for i := 1; i < n; i++ {
        if nums[i] - nums[i-1] == 1 {
            end = nums[i]
        } else {
            if start < end {
                ans = append(ans, fmt.Sprintf("%d->%d", start, end))
            } else {
                ans = append(ans, fmt.Sprintf("%d", start))
            }
            start = nums[i]
        }
    }
    if start < end {
        ans = append(ans, fmt.Sprintf("%d->%d", start, end))
    } else {
        ans = append(ans, fmt.Sprintf("%d", start))
    }    

    return ans
}

python3 解法, 执行用时: 40 ms, 内存消耗: 13.6 MB, 提交时间: 2020-11-20 11:28:42

class Solution:
    def summaryRanges(self, nums: List[int]) -> List[str]:
        n, ans = len(nums), []
        if n == 0:
            return ans
        start, end = nums[0], nums[0]
        for i in range(1, n):
            if nums[i] - nums[i-1] == 1:
                end = nums[i]
            else:
                ans.append(f'{start}->{end}' if end > start else f'{start}')
                start = nums[i]
        ans.append(f'{start}->{end}' if end > start else f'{start}')
        return ans