Solution of K-diff Pairs in an Array

Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i, j), where i and j are both numbers in the array and their absolute difference is k.

Example 1:
Input: [3, 1, 4, 1, 5], k = 2
Output: 2
Explanation: There are two 2-diff pairs in the array, (1, 3) and (3, 5).
Although we have two 1s in the input, we should only return the number of unique pairs.

Example 2:
Input:[1, 2, 3, 4, 5], k = 1
Output: 4
Explanation: There are four 1-diff pairs in the array, (1, 2), (2, 3), (3, 4) and (4, 5).

Example 3:
Input: [1, 3, 1, 5, 4], k = 0
Output: 1
Explanation: There is one 0-diff pair in the array, (1, 1).

Note:
The pairs (i, j) and (j, i) count as the same pair.
The length of the array won’t exceed 10,000.
All the integers in the given input belong to the range: [-1e7, 1e7].

Ideas of solving a problem
They want the absolute value of the difference between the two Numbers to be k, so k has to be greater than or equal to 0, and when k is less than 0, the program returns 0.In this case, we can use the hash table to avoid the effect of the same elements in the array.The problem requires that the difference between the two elements be 2, so we only need to determine whether num + - 2 is also in the hash table.Use a new hash table to record the larger values, and return the length of the hash table is the answer. The time complexity is O(n), and the space complexity is O(1).

Code

package main

import "fmt"

func main() {
	input := []int{3, 1, 4, 1, 5}
	var answer int
	answer=findPairs(input,2)
	fmt.Println(answer)
}
func findPairs(nums []int, k int) int {
	if k < 0 {
		return 0
	}
	same:=make(map[int]bool)
	diff:=make(map[int]bool)
	for _,num:=range nums {
		if same[num + k] {
			diff[num + k] = true
		}
		if same[num - k] {
			diff[num] = true
		}
		same[num] = true
	}
	return len(diff)
	}

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/k-diff-pairs-in-an-array