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;
}
}