求解最长无重复子数组,而不是最长无重复子数组的长度
function maxSubArr(arr) {
let max = 0
let index = 0
let queue = []
for (let i = 0; i < arr.length; i++) {
let ele = arr[i]
while (queue.find(item => item.value === ele)) {
queue.shift()
}
queue.push({
index: i,
value: arr[i]
})
if (queue.length > max) {
index = queue[0].index
max = queue.length
}
}
return arr.slice(index, max)
}
console.log(maxSubArr([1, 2, 3, 4, 3]))