LeetCode 128. 最长连续序列 (Java)

LeetCode 128. 最长连续序列 (Java)

##Array##, ##Union Find##

并查集$O(n)$

哈希表存储每个值-下标作为对应的键值对

将连续的值(a = b + 1)通过并查集维护成为联通分量

最后找出最大的联通分量，输出其大小

class Solution {
    class UnionFind {
        int n;
        int[] p;
        int[] size;

        public void init(int n) {
            p = new int[n];
            size = new int[n];
            for (int i = 0; i < n; i ++) {
                p[i] = i;    
                size[i] = 1;
            }
        }

        public int find(int x) {
            if (x != p[x]) p[x] = find(p[x]);
            return p[x];
        }

        public void union(int x, int y) {
            size[find(x)] += size[find(y)];
            p[find(y)] = find(x);
        }
    }

    public int longestConsecutive(int[] nums) {
        int n = nums.length;
        if (n == 0 || n == 1) return n;
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();

        for (int i = 0; i < n; i ++) {
            if (map.get(nums[i]) == null) {
                map.put(nums[i], i);
            }
        }

        UnionFind uf = new UnionFind();
        uf.init(n);

        for (int i : map.keySet()) {
            if (map.containsKey(i - 1)) {
                uf.union(map.get(i), map.get(i - 1));
            }    
        }

        int res = -1;
        for (int i = 0; i < n; i ++) {
            res = Math.max(res, uf.size[i]);
        }

        return res;

    }
}