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 class Solution {
    public int longestConsecutive(int[] num) {
        int max = 0;
		Set<Integer> set = new HashSet<Integer>();
		for(int i = 0; i < num.length; i++)
			set.add(num[i]);
		for(int i = 0; i < num.length; i++)
		{
			int cnt = 1;
			set.remove(num[i]);
			int tmp = num[i];
			while(set.contains(tmp - 1))
			{
				set.remove(tmp - 1);
				cnt++;
				tmp = tmp - 1;
			}
			tmp = num[i];
			while(set.contains(tmp + 1))
			{
				set.remove(tmp + 1);
				cnt++;
				tmp = tmp + 1;
			}
			max = Math.max(max, cnt);
		}
		return max;
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值