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

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 maxLen = 0;
        int i, j;
        for(i=0,j=0;i<arr.length;i++){
            if(map.containsKey(arr[i])){
                //j = i;
                j = Math.max(j, map.get(arr[i]) + 1);
            } 
            map.put(arr[i], i);
            maxLen = Math.max(maxLen, i-j+1);

        }
        return maxLen;

    }
}