LeetCode 128 - Longest Consecutive Sequence

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 int longestConsecutive(int[] num) {
    if(num==null || num.length<1) return 0;
    HashSet<Integer> set = new HashSet<Integer>(num.length);
    for(int e:num) {
        set.add(e);
    }
    int result = 1;
    for(int e:num) {
        int count = 1;
        int left = e-1;
        int right = e+1;
        while(set.contains(left)) {
            count++;
            set.remove(left--);
        }
        while(set.contains(right)) {
            count++;
            set.remove(right++);
        }
        result = Math.max(result, count);
    }
    return result;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值