ImAlpha/LeetCode
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

solves 69/73 cases, timed out

Browse Source
This commit is contained in:
Jacob Delgado 2023-09-06 11:15:15 -07:00
parent 3e7d66d2d6
commit 15bd3181c2
2 changed files with 40 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
NeetCodeRoadmap/Arrays_and_Hashing/128_Longest_Consecutive_Sequence.py
View File

@ -1,21 +0,0 @@
def longestConsecutive(nums):
"""
:type nums: List[int]
:rtype: int
"""
nums.sort()
length = len(nums)
sequence = []
larger = []
for x in nums:
if x < length and x not in sequence:
sequence.append(x)
elif x == max(sequence)+1:
sequence.append(x)
else:
larger.append(x)
return len(sequence)
print(longestConsecutive([100,4,200,1,3,2]))
print(longestConsecutive([0,3,7,2,5,8,4,6,0,1]))
print(longestConsecutive([1,3,5,2,4]))

40
NeetCodeRoadmap/Two_Pointers/128_Longest_Consecutive_Sequence.py Normal file
View File

@ -0,0 +1,40 @@
def longestConsecutive(nums):
"""
:type nums: List[int]
:rtype: int
"""
# Handle edge-case
if len(nums) < 1:
return 0
nums.sort()
sequence = [nums[0]]
answer = 0
temp = None
print(nums)
for r in range(len(nums)):
# print(nums[r])
# print(f'seq is {sequence} with len of {len(sequence)}')
if nums[r] == max(sequence)+1 and nums[r] not in sequence:
# print(f'hit {nums[r]}')
sequence.append(nums[r])
elif nums[r] == max(sequence):
continue
else:
print(f'seq is {sequence} with len of {len(sequence)}')
if len(sequence) > answer:
answer = len(sequence)
# print('hit')
sequence.clear()
sequence.append(nums[r])
if len(sequence) > answer:
return len(sequence)
else:
return answer
# print(longestConsecutive([100,4,200,1,3,2]))
# print(longestConsecutive([0,3,7,2,5,8,4,6,0,1]))
# print(longestConsecutive([1,3,5,2,4]))
# print(longestConsecutive([9,1,4,7,3,-1,0,5,8,-1,6]))
print(longestConsecutive([1,2,0,1]))