Skip to content

Commit e0d74da

Browse files
committed
add: longestConsecutiveSequence solution
1 parent ff227d7 commit e0d74da

1 file changed

Lines changed: 22 additions & 0 deletions

File tree

Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
var longestConsecutive = function (nums) {
2+
// ์ˆซ์ž ์กด์žฌ ์œ ๋ฌด๋ฅผ ํ™•์ธํ•  ์ˆ˜ ์žˆ๋Š” ์ž๋ฃŒ๊ตฌ์กฐ ์„ธํŒ…
3+
const dataSet = new Set(nums);
4+
let answer = 0;
5+
6+
// ์ „์ฒด ์ˆซ์ž๋ฅผ ์ˆœํšŒํ•˜๋ฉด์„œ ์‹œ์ž‘์ ์„ ํ™•์ธ
7+
for (let num of dataSet) {
8+
// num - 1์ด dataSet์— ์žˆ๋Š”์ง€ ํ™•์ธ. ์žˆ๋‹ค๋ฉด ์‹œ์ž‘์ ์ด ์•„๋‹ˆ๋ฏ€๋กœ ํŒจ์Šค
9+
if (!dataSet.has(num - 1)) {
10+
// ์—†๋‹ค๋ฉด ์‹œ์ž‘์ . ์—ฌ๊ธฐ์„œ๋ถ€ํ„ฐ ์—ฐ์†๋œ ์ˆซ์ž๊ฐ€ ์–ผ๋งˆ๋‚˜ ์žˆ๋Š”์ง€ ์นด์šดํŒ….
11+
let count = 1;
12+
let target = num;
13+
while (dataSet.has(target + 1)) {
14+
count++;
15+
target++;
16+
}
17+
// longest๋ฅผ ๊ตฌํ•˜๋Š” ๋ฌธ์ œ์ด๋ฏ€๋กœ max๋กœ ๋” ๊ธด ๋‹ต์„ ํŒ๋‹จ
18+
answer = Math.max(count, answer);
19+
}
20+
}
21+
return answer;
22+
};

0 commit comments

Comments
ย (0)