532. 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-diffpair 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:

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

 

思路:

1,数组若是只有0个或者一个数,直接返回[]

2,排序

      从第一个数开始,遍历一遍,每个数与后一个做差,得到的值为k则计数器+1

      遍历时,同一个数只遍历一次

      做差时,同一个数只差一次

#pragma once

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

class Solution {
public:
	int findPairs(vector<int>& nums, int k) {
		//判断数组长度
		if (nums.size() <= 1)
		{
			return 0;
		}

		//
		int t = 0;//计数器
		int b = 0;//与遍历的数做差的数,保证只减一次
		sort(nums.begin(), nums.end());
		for (int i = 0; i < nums.size()-1; i++)
		{
			if (i > 0 && nums[i] == nums[i - 1])
			{
				continue;
			}
			b = nums[i+1];
			for (int j = i + 1; j < nums.size(); j++)
			{
				
				if ((j==i+1&& nums[j] - nums[i] == k)||(nums[j] - nums[i] == k&&b != nums[j]))
				{
					b = nums[j];
					t++;
				}
			}

		}
		return t;
	}
};

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值