edit longest consecutive sequence solution

Author: bhan

longest-consecutive-sequence/byol-han.js

@@ -3,25 +3,21 @@
  * @return {number}
  */
 var longestConsecutive = function (nums) {
-  if (nums.length === 0) return 0;
+  if (nums.length === 0) return nums.length;
 
-  const numSet = new Set(nums);
-  let longest = 0;
-  for (let num of numSet) {
-    // `num - 1`이 없으면 새로운 수열의 시작점
-    if (!numSet.has(num - 1)) {
-      let count = 1;
-      let currentNum = num;
+  const setNums = new Set(nums);
+  const sortNums = [...setNums].sort((a, b) => a - b);
 
-      // 연속된 숫자 찾기
-      while (numSet.has(currentNum + 1)) {
-        currentNum++;
-        count++;
-      }
+  let longest = 1;
+  let currentlength = 1;
 
-      longest = Math.max(longest, count);
+  for (let i = 0; i < sortNums.length; i++) {
+    if (sortNums[i] + 1 === sortNums[i + 1]) {
+      currentlength++;
+      longest = Math.max(longest, currentlength);
+    } else {
+      currentlength = 1;
     }
   }
-
   return longest;
 };