We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 4091c09 commit 7728d5cCopy full SHA for 7728d5c
solution/0100-0199/0128.Longest Consecutive Sequence/Solution.cpp
@@ -0,0 +1,16 @@
1
+class Solution {
2
+public:
3
+ int longestConsecutive(vector<int>& nums) {
4
+ int res = 0;
5
+ unordered_set<int> set{nums.begin(), nums.end()};
6
+ for (int num : nums) {
7
+ if (!set.count(num)) continue;
8
+ set.erase(num);
9
+ int pre = num - 1, next = num + 1;
10
+ while (set.count(pre)) set.erase(pre--);
11
+ while (set.count(next)) set.erase(next++);
12
+ res = max(res, next - pre - 1);
13
+ }
14
+ return res;
15
16
+};
0 commit comments