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

import java.util.*;

public class Solution { /** * * @param arr int整型一维数组 the array * @return int整型 */ public int maxLength (int[] arr) { Map<Integer, Integer> map = new HashMap<>();

    int left = -1, maxLen = 0;
    for(int i = 0;i<arr.length;i++){
        if(map.containsKey(arr[i])){
            left = Math.max(left, map.get(arr[i]));
        }
        map.put(arr[i], i);
        maxLen = Math.max(maxLen, map.get(arr[i]) -left);
    }
    return maxLen;
    
}

}