Download Longest Consecutive Sequence.py
class Solution(object): def longestConsecutive(self, nums): """ :type nums: List[int] :rtype: int """ def longestConsecutive(self, num): # Pop adjacency O(n) and O(n) num = set(num) maxLen = 0 while num: n = num.pop() i = n + 1 l1 = 0 l2 = 0 while i in num: num.remove(i) i += 1 l1 += 1 i = n - 1 while i in num: num.remove(i) i -= 1 l2 += 1 maxLen = max(maxLen, l1 + l2 + 1) return maxLen
Leetcode 128 Longest Consecutive Sequence problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.