[LintCode/LeetCode] Longest Consecutive Sequence

weixin_33775572

于 2016-04-13 10:04:13 发布

阅读量61

点赞数

CC 4.0 BY-SA版权

原文链接：https://segmentfault.com/a/1190000004927611

本文介绍了一种算法，用于在给定的无序整数数组中找到最长的连续整数序列。通过排序和计数数组元素之间的连续性，该算法能够在O(n)复杂度下运行，有效解决此问题。

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

Problem

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

Clarification

Your algorithm should run in O(n) complexity.

Example

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

Note

先排序，然后用count[]数组记录每一位上连续序列的长度，每次循环更新最大值存为max。

Solution

public class Solution {
    public int longestConsecutive(int[] num) {
        Arrays.sort(num);
        int[] count = new int[num.length];
        count[0] = 1;
        int max = 1;
        for (int i = 1; i < num.length; i++) {
            if (num[i] == num[i-1]) count[i] = count[i-1];
            else if (num[i] == num[i-1]+1) count[i] = count[i-1]+1;
            else count[i] = 1;
            max = Math.max(max, count[i]);
        }
        return max;
    }
}