forked from CodersForLife/Data-Structures-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTwoSum.cpp
More file actions
41 lines (33 loc) · 721 Bytes
/
Copy pathTwoSum.cpp
File metadata and controls
41 lines (33 loc) · 721 Bytes
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
#include <iostream>
#include <vector>
using namespace std;
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> ans;
int n = nums.size();
if(n == 0 || n == 1)
return ans;
unordered_map<int,int> um;
um[nums[0]] = 0;
for(int i=1;i<n;i++)
{
auto it = um.find(target - nums[i]);
if(it != um.end())
{
ans.push_back((*it).second);
ans.push_back(i);
break;
}
um[nums[i]] = i;
}
return ans;
}
int main() {
vector<int> array;
int number, target;
cin>>target;
while (cin >> number) {
array.push_back(number);
}
cout << twoSum(array, target) << endl;
return 0;
}