150强访谈简单

最长连续序列

“最长连续序列”问题的详细指南和 Python 实现。

问题陈述

简单

给定一个未排序的整数数组 nums,返回最长连续元素序列的长度。

您必须编写一个在 O(n) 时间内运行的算法。

编写一个函数 longestConsecutive(nums: List[int]) -> int

约束条件
  • 0 <= len(nums) <= 10^5
  • -10^9 <= nums[i] <= 10^9

示例

Example 1
Input
nums = [100, 4, 200, 1, 3, 2]
Output
4
Explanation

The longest consecutive elements sequence is [1, 2, 3, 4]. Its length is 4.

Example 2
Input
nums = [0, 3, 7, 2, 5, 8, 4, 6, 0, 1]
Output
9
Explanation

The longest consecutive elements sequence is [0, 1, 2, 3, 4, 5, 6, 7, 8]. Its length is 9.

Need a Hint?
考虑使用数组和哈希特定的数据结构,例如集合或堆。
Edge Cases to Watch
  • 空输入结构
  • 单元素输入
  • 大数值范围

准备好解决了吗?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在编辑器中打开
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推荐的 Python 资源

通过相关的交互式教程、备忘单和代码比较来扩展您的知识。