A length of the longest consecutive elements sequence can be obtained from an unsorted array of integers by running the algorithm O(n) time.

A length of the longest consecutive elements sequence can be obtained from an unsorted array of integers by running the algorithm O(n) time.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, qualcomm, company-specific

目标公司: Qualcomm

参考答案摘要

Example 1: Input: nums = [100,4,200,1,3,2] Output: 4 Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4. Example 2: Input: nums = [0,3,7,2,5,8,4,6,0,1] O...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。