存在重复元素 II

// 存在重复元素II
package hashtable

import (
	"math"
)

func ContainsNearbyDuplicate(nums []int, k int) bool {

	min := math.MaxInt
	repeatMap := map[int][]int{}
	for index, value := range nums {
		slice := repeatMap[value]
		slice = append(slice, index)
		repeatMap[value] = slice
	}
	for _, value := range repeatMap {
		// size里面存储的是索引
		min = getMin(value, min, k)
	}
	if min <= k && min > 0 {
		return true
	}
	return false
}

// 取坐标数组相减的最小值
func getMin(size []int, min int, k int) int {
	length := len(size)
	if length < 2 {
		return min
	}
	for i := length - 1; i >= 1; i-- {
		for j := i - 1; j >= 0; j-- {
			min := minValue(min, size[i]-size[j])
			if min <= k {
				return min
			}
		}
	}
	return min
}

// 取最小值
func minValue(x, y int) int {
	if x < y {
		return x
	}
	return y
}

// 力扣官方题解
func ContainsNearbyDuplicateII(nums []int, k int) bool {
	pos := map[int]int{}
	for i, num := range nums {
		if p, ok := pos[num]; ok && i-p <= k {
			return true
		}
		pos[num] = i
	}
	return false
}