Class Solution
java.lang.Object
g0101_0200.s0128_longest_consecutive_sequence.Solution
128 - Longest Consecutive Sequence.<p>Medium</p>
<p>Given an unsorted array of integers <code>nums</code>, return <em>the length of the longest consecutive elements sequence.</em></p>
<p>You must write an algorithm that runs in <code>O(n)</code> time.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums = [100,4,200,1,3,2]</p>
<p><strong>Output:</strong> 4</p>
<p><strong>Explanation:</strong> The longest consecutive elements sequence is <code>[1, 2, 3, 4]</code>. Therefore its length is 4.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums = [0,3,7,2,5,8,4,6,0,1]</p>
<p><strong>Output:</strong> 9</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>0 <= nums.length <= 10<sup>5</sup></code></li>
<li><code>-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
longestConsecutive
public int longestConsecutive(int[] nums)
-