面试题库
正在加载内容
请稍候,正在为你获取题目资料。
← 返回 bytedance 的题目列表
Longest Consecutive Sequence
类型:online_judge
Given an unsorted array of integers, find the length of the longest consecutive sequence. The algorithm should run in O(n) complexity. Example Input nums = [100, 4, 200, 1, 3, 2]