-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPairsWithDifferenceK.java
More file actions
68 lines (58 loc) · 1.59 KB
/
PairsWithDifferenceK.java
File metadata and controls
68 lines (58 loc) · 1.59 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
import java.util.*;
public class Solution {
public static int getPairsWithDifferenceK(int arr[], int k) {
HashMap<Integer,Integer> map = new HashMap<>();
int count = 0;
if(k!=0)
{
for(int i =0;i<arr.length;i++)
{
int p1 = arr[i]+k;
int p2 = arr[i]-k;
if(map.containsKey(p1))
{
count+=map.get(p1);
}
if(map.containsKey(p2))
{
count+=map.get(p2);
}
if(!map.containsKey(arr[i]))
{
map.put(arr[i],1);
}
else if(map.containsKey(arr[i]))
{
int value = map.get(arr[i]);
value++;
map.put(arr[i],value);
}
}
}
if(k==0)
{
for(int i =0;i<arr.length;i++)
{
if(!map.containsKey(arr[i]))
{
map.put(arr[i],1);
}
else if(map.containsKey(arr[i]))
{
int value = map.get(arr[i]);
value++;
map.put(arr[i],value);
}
}
for(int i =0;i<arr.length;i++)
{
int n = map.get(arr[i]);
if(n>0){
count+=(n*(n-1)/2);
map.put(arr[i],0);
}
}
}
return count;
}
}