LeetCode/solutions/cpp/0128.cpp at master · SnistAheads/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
class Solution {
public:
    int longestConsecutive(vector<int>& nums) {
        int ans = 0;
        unordered_set<int> set(nums.begin(), nums.end());

        for (auto& num : set)
            if (!set.count(num - 1)) {
                int currNum = num;
                int currAns = 1;
                while (set.count(currNum + 1)) {
                    currNum++;
                    currAns++;
                }
                ans = max(ans, currAns);
            }

        return ans;
    }
};