题解 | #最长无重复子数组#

通过map滑动窗口更新当前无重复队列的start index
class Solution:
    def maxLength(self , arr: List[int]) -> int:
        maxlen=0
        staridx=0
        ss=dict()
        i=0
        while i<len(arr):
            if arr[i] in ss:
                staridx=max(staridx,ss[arr[i]]+1)
            maxlen=max(maxlen,i-staridx+1) 
            ss[arr[i]]=i
            i=i+1
        return maxlen