-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpairs.cpp
More file actions
126 lines (94 loc) · 2.52 KB
/
pairs.cpp
File metadata and controls
126 lines (94 loc) · 2.52 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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);
/*
* Complete the 'pairs' function below.
*
* The function is expected to return an INTEGER.
* The function accepts following parameters:
* 1. INTEGER k
* 2. INTEGER_ARRAY arr
*/
int pairs(int k, vector<int> arr)
{
int match = 0;
int diff = k;
unordered_set<int> set;
for (int i : arr)
{
set.insert(i);
}
for (int i = 0; i < arr.size(); i++)
{
// check if pair with the given difference `(arr[i], arr[i]-diff)` exists
if ((set.find(arr[i] - diff) != set.end()))
{
// cout << "(" << arr[i] << ", " << arr[i] - diff << ")\n";
match++;
}
// check if pair with the given difference `(arr[i]+diff, arr[i])` exists
if ((set.find(arr[i] + diff) != set.end()))
{
// cout << "(" << arr[i] + diff << ", " << arr[i] << ")\n";
match++;
}
// insert the current element into the set
// set.insert(arr[i]);
set.erase(set.find(arr[i]));
}
cout << match;
return match;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string first_multiple_input_temp;
getline(cin, first_multiple_input_temp);
vector<string> first_multiple_input = split(rtrim(first_multiple_input_temp));
int n = stoi(first_multiple_input[0]);
int k = stoi(first_multiple_input[1]);
string arr_temp_temp;
getline(cin, arr_temp_temp);
vector<string> arr_temp = split(rtrim(arr_temp_temp));
vector<int> arr(n);
for (int i = 0; i < n; i++)
{
int arr_item = stoi(arr_temp[i]);
arr[i] = arr_item;
}
int result = pairs(k, arr);
fout << result << "\n";
fout.close();
return 0;
}
string ltrim(const string &str)
{
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace))));
return s;
}
string rtrim(const string &str)
{
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end());
return s;
}
vector<string> split(const string &str)
{
vector<string> tokens;
string::size_type start = 0;
string::size_type end = 0;
while ((end = str.find(" ", start)) != string::npos)
{
tokens.push_back(str.substr(start, end - start));
start = end + 1;
}
tokens.push_back(str.substr(start));
return tokens;
}