Golang Leetcode 219. Contains Duplicate II.go

版权声明：原创勿转 https://blog.csdn.net/anakinsun/article/details/89043366

思路

用hash表保存出现过的元素，找到的时候判断一下距离

code

func containsNearbyDuplicate(nums []int, k int) bool {
	if len(nums) < 2 {
		return false
	}
	m := make(map[int]int)
	for i, v := range nums {
		val, ok := m[nums[i]]
		if ok {
			if val+k >= i {
				return true
			}
		}
		m[v] = i
	}
	return false
}

更多内容请移步我的repo： https://github.com/anakin/golang-leetcode