Given an array of integers nums and an integer k, return the number of unique k-diff pairs in the array. A k-diff pair is an integer pair (nums[i], nums[j]), where both of the following are true:

0 <= i < j < nums.length

|nums[i] - nums[j]| == k

Note: |x| is the absolute value of x.

Output: 2