Given an unsorted array of integers nums, return the length of the longest sequence of consecutive integers (like 4, 5, 6, 7) whose values all appear in nums.
Aim for O(n) time.
Examples
Example 1
- Input
- nums = [100, 4, 200, 1, 3, 2]
- Output
- 4
- Why
- The longest run is 1, 2, 3, 4.
Example 2
- Input
- nums = [0, 3, 7, 2, 5, 8, 4, 6, 0, 1]
- Output
- 9
Constraints
0 <= nums.length <= 10^5-10^9 <= nums[i] <= 10^9