LeetCode – Longest Consecutive Sequence (Java)
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
For example, given [100, 4, 200, 1, 3, 2]
, the longest consecutive elements sequence should be [1, 2, 3, 4]
. Its length is 4.
Your algorithm should run in O(n) complexity.
Java Solution 1
Because it requires O(n) complexity, we can not solve the problem by sorting the array first. Sorting takes at least O(nlogn) time.
We can use a HashSet to add and remove elements. HashSet is implemented by using a hash table. Elements are not ordered. The add, remove and contains methods have constant time complexity O(1).
public static int longestConsecutive(int[] num) { // if array is empty, return 0 if (num.length == 0) { return 0; } Set<Integer> set = new HashSet<Integer>(); int max = 1; for (int e : num) set.add(e); for (int e : num) { int left = e  1; int right = e + 1; int count = 1; while (set.contains(left)) { count++; set.remove(left); left; } while (set.contains(right)) { count++; set.remove(right); right++; } max = Math.max(count, max); } return max; } 
Java Solution 2
We can also project the arrays to a new array with length to be the largest element in the array. Then iterate over the array and get the longest consecutive sequence. If the largest number is too large, then the time would be bad. This is just another thought.
<pre><code> String foo = "bar"; </code></pre>

Jesus Ledesma

Elior Malul

Elior Malul

sarthak sehgal

Anita CT

Anita CT

sarthak sehgal

k3vi

k3vi

Aashish Kalia

kayal

ryanlr

Wang Shuhao

rupalph

Vaibhav Gupta

Matias SM

Matias SM

Eugene Arnatovich

Renzo Nuccitelli

Renzo Nuccitelli

animesh

animesh

coder

dawei su

Vimukthi Weerasiri

ygw

Tony Wang

PK

PK

rs

Aaron Zhang

Paul Sun

ryanlr

ryanlr

ryanlr

Mo

cj

Dun Liu

violethaze

Wellwisher