leetcode刷题笔记(Golang)--219. Contains Duplicate II

最新推荐文章于 2024-10-18 23:42:37 发布

圆滚滚coder

最新推荐文章于 2024-10-18 23:42:37 发布

阅读量117

点赞数

分类专栏： leetcode刷题笔记(Golang) 文章标签：算法 go golang leetcode

本文链接：https://blog.csdn.net/weixin_44555304/article/details/104599170

版权

leetcode刷题笔记(Golang) 专栏收录该内容

172 篇文章 4 订阅

订阅专栏

219. Contains Duplicate II

Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.

Example 1:

Input: nums = [1,2,3,1], k = 3
Output: true
Example 2:

Input: nums = [1,0,1,1], k = 1
Output: true
Example 3:

Input: nums = [1,2,3,1,2,3], k = 2
Output: false

func containsNearbyDuplicate(nums []int, k int) bool {
	dic := make(map[int]int)
	for i, v := range nums {
		if val, ok := dic[v]; ok {
			if i-val <= k {
				return true
			}
		}
		dic[v] = i
	}
	return false
}