Longest Consecutive Sequence

LeetCode題目: 128. Longest Consecutive Sequence

My solution:

/**
 * @param {number[]} nums
 * @return {number}
 */
let longestConsecutive = nums => {
    if(nums.length === 0) return 0;
    let max = 0, consecutive = 0;
    let sortNums = nums.sort((a, b) => a - b);
    for(let i=0; i<sortNums.length; i++) {
        if(sortNums[i] === sortNums[i-1]) continue;
        (sortNums[i] === sortNums[i-1]+1) ? consecutive++ : consecutive = 1;
        max = Math.max(max, consecutive);
    }
    return max;
};
profile-image
Hi, 我是 Zeki。目前為一名前端工程師。我相信科技始終來自於人性,是用來幫助人們過上更有品質的生活的,但願也希望如此。