We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e51af94 commit df2c6c6Copy full SHA for df2c6c6
longest-consecutive-sequence/RiaOh.js
@@ -0,0 +1,23 @@
1
+/**
2
+ * @param {number[]} nums
3
+ * @return {number}
4
+ */
5
+var longestConsecutive = function (nums) {
6
+ if (nums.length === 0) {
7
+ return 0;
8
+ }
9
+ const set = new Set(nums);
10
+ const uniquiArr = [...set];
11
+ uniquiArr.sort((a, b) => a - b);
12
+ const lengthArr = [1];
13
+ for (let i = 1; i < uniquiArr.length; i++) {
14
+ if (uniquiArr[i - 1] + 1 === uniquiArr[i]) {
15
+ const last = lengthArr[lengthArr.length - 1] + 1;
16
+ lengthArr.pop();
17
+ lengthArr.push(last);
18
+ } else {
19
+ lengthArr.push(1);
20
21
22
+ return Math.max.apply(null, lengthArr);
23
+};
0 commit comments