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.
问题:
给出一个未排序的整数数组,找出最长的连续元素序列的长度。
如:
给出[100, 4, 200, 1, 3, 2],
最长的连续元素序列是[1, 2, 3, 4]。返回它的长度:4。
你的算法必须有O(n)的时间复杂度
思路:
哈希表法,每个元素只遍历一次,用该元素+1,-1,循环查找是否存在哈希表中。
**:在1,2,3,4中只需查找其中任意一个即可返回4, 不用遍历四次。
int longestConsecutiveSequence(vector<int>&nums)
{
unordered_map<int, bool>used;
for (int i : nums)
used[i] = false;
int longest = 0;
for (auto i : nums)
{
if (used[i])
continue;
int length = 1;
used[i] = true;
for (int j = i + 1; used.find(j) != used.end(); j++)
{
used[j] == true;
length++;
}
for (int j = i - 1; used.find(j) != used.end(); j--)
{
used[j] == true;
length++;
}
longest = max(length, longest);
}
return longest;
}