-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path167.cpp
80 lines (72 loc) · 1.77 KB
/
167.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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include <gtest/gtest.h>
#include <map>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> twoSum(vector<int> &numbers, int target)
{
map<int, int> m;
for (int i = 0; i < numbers.size(); i++) {
if (m.find(numbers[i]) != m.end()) {
return {m[numbers[i]], i + 1};
}
else {
m[target - numbers[i]] = i + 1;
}
}
return {};
}
};
class Testing : public testing::Test {
public:
Solution s;
};
TEST_F(Testing, BasicTest)
{
vector<int> numbers = {2, 7, 11, 15};
int target = 9;
vector<int> result = s.twoSum(numbers, target);
vector<int> expected = {1, 2};
EXPECT_EQ(result, expected);
}
TEST_F(Testing, NoSolution)
{
vector<int> numbers = {1, 2, 3, 4};
int target = 8;
vector<int> result = s.twoSum(numbers, target);
vector<int> expected = {};
EXPECT_EQ(result, expected);
}
TEST_F(Testing, MultipleSolutions)
{
vector<int> numbers = {1, 3, 3, 4};
int target = 6;
vector<int> result = s.twoSum(numbers, target);
vector<int> expected = {2, 3};
EXPECT_EQ(result, expected);
}
TEST_F(Testing, NegativeNumbers)
{
vector<int> numbers = {-1, -2, -3, -4};
int target = -6;
vector<int> result = s.twoSum(numbers, target);
vector<int> expected = {2, 4};
EXPECT_EQ(result, expected);
}
TEST_F(Testing, SingleElementArray)
{
vector<int> numbers = {5};
int target = 5;
vector<int> result = s.twoSum(numbers, target);
vector<int> expected = {};
EXPECT_EQ(result, expected);
}
TEST_F(Testing, EmptyArray)
{
vector<int> numbers = {};
int target = 0;
vector<int> result = s.twoSum(numbers, target);
vector<int> expected = {};
EXPECT_EQ(result, expected);
}