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 資源

透過相關的互動式教學、備忘單和程式碼比較來擴展您的知識。