题目:
代码:
import numpy as np
class Solution(object):
def longestConsecutive(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
nums = set(nums)
nums = list(nums)
nums.sort()
print(nums)
N = len(nums)
left = 0
res = 1
if len(nums) == 0:
return 0
for right in range(1,N):
if nums[right] - nums[right - 1] != 1:
left = right
else:
res = max(res, right - left + 1)
return res
if __name__ == '__main__':
nums = [np.random.randint(1,12) for i in range (8)]
print('nums =',nums)
w = Solution()
res = w.longestConsecutive(nums)
print('result = ', res)