532. K-diff Pairs in an Array

本文介绍了一种算法,用于解决在整数数组中寻找特定差值k的唯一数对问题,并提供了详细的C#实现代码。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

原题

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].

代码分析

     public int FindPairs(int[] nums, int k)
      {
            int sum = 0;
            if (nums.Length == 0 || nums.Length == 1) return 0;
            System.Array.Sort(nums);
            for (int i = 0; i < nums.Length; i++)
            {
                bool eql = false;
                for (int j = i + 1; j < nums.Length; j++)
                {
                    while (j < nums.Length && nums[j] == nums[i])
                    {
                        j++;
                        eql = true;
                    }
                    if (eql) //找到了相等元素
                    {
                        i = j - 1; //j-1>i=0 //i等于某一块相等元素的末端点
                        if (k == 0)
                        {
                            sum++;
                            break;
                        }
                        eql = false;
                    }
                    while (j + 1 < nums.Length && nums[j + 1] == nums[j])
                        j++; //j等于后一块相等元素的末端点                 
                    if (j < nums.Length && nums[j] - nums[i] > k) //
                        break;
                    if (j < nums.Length && nums[j] - nums[i] == k)
                        sum++;
                }
            }
            return sum;
    }

leetcode-solution库

leetcode算法题目解决方案每天更新在github库中,欢迎感兴趣的朋友加入进来,也欢迎star,或pull request。https://github.com/jackzhenguo/leetcode-csharp

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值