题解 | 最长无重复子数组

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param arr int整型一维数组 the array
 * @return int整型
 */
function maxLength(arr) {
    if (arr.length === 0) return 0;
    let left = 0;
    let maxLen = 0;
    const map = new Map();
    for (let right = 0; right < arr.length; right++) {
        const currentChar = arr[right];

        if (map.has(currentChar) && map.get(currentChar) >= left) {
            left = map.get(currentChar) + 1;
        }
        map.set(currentChar,right);
        maxLen = Math.max(maxLen, right - left + 1);
    }
    return maxLen;
}
module.exports = {
    maxLength: maxLength,
};