Longest Consecutive Sequence

iteye_6755

于 2015-09-11 13:51:42 发布

阅读量64

点赞数

分类专栏： leetcode

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文介绍了一种算法，用于在未排序的整数数组中找到最长的连续整数序列。通过使用HashSet来优化查找过程，该算法能够在O(n)复杂度下运行，有效地解决这一问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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[] nums) {
        if (nums == null || nums.length == 0) {
        	return 0;
        }
        HashSet<Integer> hashSet = new HashSet<Integer>();
        for (int i = 0; i < nums.length; i++) {
        	hashSet.add(nums[i]);
		}
        int res = 0;
        for (int i = 0; i < nums.length; i++) {
			if (hashSet.contains(nums[i])) {
				int cnt = 1;
				hashSet.remove(nums[i]);
				int low = nums[i] - 1;
				while (hashSet.contains(low)) {
					cnt++;
					hashSet.remove(low);
					low--;
				}
				int high = nums[i] + 1;
				while (hashSet.contains(high)) {
					cnt++;
					hashSet.remove(high);
					high++;
				}
				res = Math.max(res, cnt);
			}
		}
        return res;
    }
}