给定一个长度为n的数组arr,返回arr的最长无重复元素子数组的长度,无重复指的是所有数字都不相同。
子数组是连续的,比如[1,3,5,7,9]的子数组有[1,3],[3,5,7]等等,但是[1,3,7]不是子数组
数据范围:,
[2,3,4,5]
4
[2,3,4,5]是最长子数组
[2,2,3,4,3]
3
[2,3,4]是最长子数组
[9]
1
[1,2,3,1,2,3,2,2]
3
最长子数组为[1,2,3]
[2,2,3,4,8,99,3]
5
最长子数组为[2,3,4,8,99]
class Solution: def maxLength(self , arr: List[int]) -> int: # write code here max=0 new_list=[] for i in range(len(arr)): if arr[i] not in new_list: new_list.append(arr[i]) else: tag=new_list.index(arr[i])+1 if max <=len(new_list): max=len(new_list) new_list=new_list[tag:] new_list.append(arr[i]) if max <=len(new_list): return len(new_list) else: return max
class Solution: def maxLength(self , arr ): maxlen=0 stack=[] for i in arr: while i in stack: stack.pop(0) stack.append(i) maxlen=max(maxlen,len(stack)) return maxlen暴力法