128. Longest Consecutive Sequence

class Solution {
public:
    int longestConsecutive(vector<int>& nums) {
        unordered_set<int>nums_set(nums.begin(),nums.end());
        int longest=0;
        for(int i=0;i<nums.size();++i){
            if(!nums_set.count(nums[i]))continue;
            nums_set.erase(nums[i]);
            int pre=nums[i]-1;
            int next=nums[i]+1;
            while(nums_set.count(pre))nums_set.erase(pre--);
            while(nums_set.count(next))nums_set.erase(next++);
            if(next-pre-1>longest)longest=next-pre-1;
        }
        return longest;
    }
};