题解 | #最长无重复子数组#
最长无重复子数组
https://www.nowcoder.com/practice/b56799ebfd684fb394bd315e89324fb4
# # 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 # # # @param arr int整型一维数组 the array # @return int整型 # class Solution: def maxLength(self , arr: List[int]) -> int: mp = dict() res = 0 left = 0 for right in range(len(arr)): if arr[right] in mp: mp[arr[right]] += 1 else: mp[arr[right]] = 1 while mp[arr[right]] > 1: mp[arr[left]] -= 1 left += 1 res = max(res, right-left+1) return res