(int k, int[] arr)
| 10 | |
| 11 | // Complete the pairs function below. |
| 12 | static int pairs(int k, int[] arr) { |
| 13 | HashSet <Integer> set = new HashSet<Integer>(); |
| 14 | int count = 0; |
| 15 | for(int i=0;i<arr.length;i++) |
| 16 | { |
| 17 | set.add(arr[i]); |
| 18 | } |
| 19 | //System.out.println(set); |
| 20 | for(int i=0;i<arr.length;i++) |
| 21 | { |
| 22 | if(set.contains(arr[i]+k)) |
| 23 | { |
| 24 | count++; |
| 25 | } |
| 26 | } |
| 27 | return count; |
| 28 | } |
| 29 | |
| 30 | private static final Scanner scanner = new Scanner(System.in); |
| 31 |