longest consecutive sequence

最新推荐文章于 2024-08-13 15:34:52 发布

小菜鸟的leetcode

最新推荐文章于 2024-08-13 15:34:52 发布

阅读量314

点赞数

文章标签： need another try union-find

本文链接：https://blog.youkuaiyun.com/Scarlett_leetcode/article/details/51394714

版权

solution

class Solution {
public:
    int longestConsecutive(vector<int>& nums) {
        unordered_set<int> st;
        for( auto n : nums ) { st.insert(n);} 
        
        int rst = 0;
        for( int n : nums) {
            int left = n - 1;
            while( st.find(left) != st.end() ) {
                st.erase(left);
                left--;
            }
            
            int right = n + 1;
            while(st.find(right) != st.end() ) {
                 st.erase(right);
                right++;
            }
            rst = max(rst, right - left - 1);
        }
        return rst;
    }
};

想法很奇妙，但是我没想到union find 怎么解