128. Longest Consecutive Sequence

最新推荐文章于 2024-06-13 05:26:23 发布

weixin_30363509

最新推荐文章于 2024-06-13 05:26:23 发布

阅读量57

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/ycled/p/3367698.html

本文介绍了一种寻找整数数组中最长连续元素序列的算法。该算法利用哈希映射存储数据，实现O(n)的时间复杂度。通过示例[100,4,200,1,3,2]，展示了如何找到最长连续序列[1,2,3,4]并返回长度4。

Given an unsorted array of integers, find the length of the longest consecutive elements sequence.

For example,
Given [100, 4, 200, 1, 3, 2],
The longest consecutive elements sequence is [1, 2, 3, 4]. Return its length: 4.

Your algorithm should run in O(n) complexity.

---

public class Solution {
    public int longestConsecutive(int[] num) {
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        int max = 1;
        for (int i : num) {
            if (map.containsKey(i)) continue;
            map.put(i, 1);
            if (map.containsKey(i - 1)) {
                max = Math.max(max, merge(map, i-1, i));
            }
            if (map.containsKey(i + 1)) {
                max = Math.max(max, merge(map, i, i+1));
            }
        }
        return max;
    }

    private int merge(HashMap<Integer, Integer> map, int left, int right) {
        int upper = right + map.get(right) - 1;
        int lower = left - map.get(left) + 1;
        int len = upper - lower + 1;
        map.put(upper, len);
        map.put(lower, len);
        return len;
    }
        
    
}