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. Exa…

public class Solution { public int FindPairs(int[] nums, int k) { var pair = new Dictionary<string, string>(); var list = nums.OrderBy(x => x).ToList(); ; i < list.Count; i++) { for (int j = i; j < list.Count; j++) { if (i == j) { continue;…

Description 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 differen…

给定一个整数数组和一个整数 k, 你需要在数组里找到不同的 k-diff 数对.这里将 k-diff 数对定义为一个整数对 (i, j), 其中 i 和 j 都是数组中的数字,且两数之差的绝对值是 k. 示例 1: 输入: [3, 1, 4, 1, 5], k = 2 输出: 2 解释: 数组中有两个 2-diff 数对, (1, 3) 和 (3, 5). 尽管数组中有两个1,但我们只应返回不同的数对的数量. 示例 2: 输入:[1, 2, 3, 4, 5], k = 1 输出: 4 解释: 数…

l两周以来,第一次睡了个爽,开心! ================================= leetcode380 https://leetcode.com/problems/insert-delete-getrandom-o1/?tab=Description leetcode381 https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/ leetcode532 https://lee…