-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2sum.cpp
31 lines (29 loc) · 855 Bytes
/
2sum.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
#include <map>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
map<int, int> map;
int count = 0;
for (int i : nums){
printf("i = %d\n", i);
map.insert({i, count});
printf("[%d, %d]\n", i, count);
int pair = target - i;
if (map.count(pair) && map[pair] != count){
printf("OUT: [%d, %d]\n", map[pair], count);
vector<int> result {map[pair], count};
return result;
}
count++;
}
vector<int> vect {};
return vect;
}
};
int main(int argc, char **argv){
Solution s;
vector<int> vect { 3, 2, 4 };
s.twoSum(vect, 6);
}