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

package main

/**
 * 
 * @param arr int整型一维数组 the array
 * @return int整型
*/

func maxLength( arr []int ) int {
	m := make(map[int]int, len(arr))
	left := 0
	right := 0
	maxLength := 0
	for {
		if left <= right && right < len(arr) {
			if index, ok := m[arr[right]]; ok {
				left = max(index+1, left)
			} 
			maxLength = max(maxLength, right - left+1)
			
			m[arr[right]] = right
			right++
		} else {
			break
		}
	}

	return maxLength
}

func max(a, b int) int {
    if a > b {
        return a
    }
    return b
}