128. Longest Consecutive Sequence(leetcode)
Posted
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了128. Longest Consecutive Sequence(leetcode)相关的知识，希望对你有一定的参考价值。
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.
Subscribe to see which companies asked this question
以上是关于128. Longest Consecutive Sequence(leetcode)的主要内容，如果未能解决你的问题，请参考以下文章
128. Longest Consecutive Sequence
128. Longest Consecutive Sequence
128. Longest Consecutive Sequence
128. Longest Consecutive Sequence