-
Notifications
You must be signed in to change notification settings - Fork 0
/
1_ArrayPairSum.cpp
63 lines (48 loc) · 1.54 KB
/
1_ArrayPairSum.cpp
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
/**
Given an integer array, output all pairs that sum up to a specific value k.
*/
#include <iostream>
#include <numeric>
#include <vector>
#include <set>
template<typename T, typename S,
typename = std::enable_if_t<std::is_integral_v<T> && std::is_integral_v<S>>>
auto validPairSum(const std::vector<T> &input, const S sumValue) {
std::vector<std::pair<T,T>> result;
if(input.size() > 2 && sumValue > 0) {
std::set<T> seen;
for(const auto & number : input) {
auto target = sumValue - number;
if(seen.find(target) == seen.end()) {
seen.insert(number);
}
else {
result.emplace_back(target,number);
}
}
}
return result;
}
int main() {
// First test: for k = 5, resulting pairs should be [2,3] and [1,4]
{
std::vector<int> testVector(10);
std:iota(testVector.begin(), testVector.end(), 1);
const int k{5};
const auto resultingPairs{validPairSum(testVector, k)};
bool testPassed{false};
std::cout << "Resulting Pairs: ";
for(const auto &pair : resultingPairs) {
std::cout << "[" << pair.first << "," << pair.second << "]";
if(pair.first + pair.second == k) {
testPassed = true;
}
else {
testPassed = false;
}
}
std::string testResult{testPassed ? "Passed" : "Failed"};
std::cout << "\nTest " << testResult;
}
return 0;
}