题解 | 最长无重复子数组
最长无重复子数组
https://www.nowcoder.com/practice/b56799ebfd684fb394bd315e89324fb4
object Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param arr int整型一维数组 the array
* @return int整型
*/
fun maxLength(arr: IntArray): Int {
if (arr.isEmpty())return 0
var left = 0
val screen = HashSet<Int>()
var maxLength = 0
for(right in 0..arr.size-1){
while(screen.contains(arr[right])){
screen.remove(arr[left])
left++
}
screen.add(arr[right])
maxLength = Math.max(maxLength, right-left+1)
}
return maxLength
}
}
