128. 最长连续序列

void1024

已于 2024-07-04 02:14:26 修改

阅读量294

点赞数 5

分类专栏：面试经典 150 题文章标签：算法 java 数据结构

于 2024-07-04 01:47:20 首次发布

本文链接：https://blog.csdn.net/diOSyu/article/details/140166140

版权

面试经典 150 题专栏收录该内容

132 篇文章 1 订阅

订阅专栏

class Solution {
    public int longestConsecutive(int[] nums) {
        Set<Integer> set = new HashSet<>();
        for (int num : nums) {
            set.add(num);
        }
        int maxLen = 0;
        for (int num : nums) {
            if (!set.contains(num - 1)) {
                int curLen = 1;
                while (set.contains(++num)) {
                    curLen++;
                }
                if (curLen > maxLen) {
                    maxLen = curLen;
                }
            }
        }
        return maxLen;
    }
}

class Uf {
    Map<Integer, Integer> map = new HashMap<>();

    public Uf(int[] nums) {
        for (int num : nums) {
            map.put(num, num);
        }
    }

    int find(int x) {
        if (map.get(x) == x) {
            return x;
        }
        map.put(x, find(map.get(x)));
        return map.get(x);
    }

    void union(int x, int y) {
        if(map.containsKey(y))
            map.put(x, y);
    }
}
class Solution {
    public int longestConsecutive(int[] nums) {
        if (nums == null || nums.length == 0) {
            return 0;
        }
        Uf uf = new Uf(nums);
        for (int num : nums) {
            uf.union(num, num + 1);
        }
        int maxLen = 1;
        for (int num : nums) {
            maxLen = Math.max(maxLen, uf.find(num) - num + 1);
        }
        return maxLen;
    }
}