dev-resources.site
for different kinds of informations.
Longest Consecutive Sequence
Published at
4/20/2022
Categories
leetcode
array
blind75
Author
Stylus07
Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.
You must write an algorithm that runs in O(n) time.
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.
var longestConsecutive = function (nums) {
let num_set = new Set(nums);
let longestStreak = 0;
for (let num of nums) {
if (!num_set.has(num - 1)) {
let currentNum = num;
let currentStreak = 1;
while (num_set.has(currentNum + 1)) {
currentNum += 1;
currentStreak += 1;
}
longestStreak = Math.max(longestStreak, currentStreak);
}
}
return longestStreak;
}
Time Complexity : O(n)
Articles
10 articles in total
Container With Most Water
read article
Logger Rate Limiter
read article
Longest Consecutive Sequence
currently reading
Encode and Decode Strings
read article
Group Anagrams
read article
Valid Anagram
read article
Contains Duplicate
read article
Peak Index in a Mountain Array
read article
Intersection of Three Sorted Arrays
read article
Change the document title on react application
read article
Featured ones: