leetcode刷题笔记(Golang)--220. Contains Duplicate III

220. Contains Duplicate III

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

Example 1:

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

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

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

花花酱

func containsNearbyAlmostDuplicate(nums []int, k int, t int) bool {
	res := []int{}
	for i := 0; i < len(nums); i++ {
		if len(res) > k {
			id := sort.SearchInts(res, nums[i-k-1])
			res = append(res[:id], res[id+1:]...)
			//fmt.Println("start", id, res, nums[i])
		}
		idx := sort.Search(len(res), func(j int) bool { return res[j] >= nums[i] })
		res = append(res[:idx], append([]int{nums[i]}, res[idx:]...)...)
		//fmt.Println("end", idx, res, nums[i])
		if idx != 0 && nums[i]-res[idx-1] <= t {
			return true
		}
		if idx < len(res)-1 && res[idx+1]-nums[i] <= t {
			return true
		}
	}
	return false
}