-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1.cpp
More file actions
66 lines (59 loc) · 1.72 KB
/
1.cpp
File metadata and controls
66 lines (59 loc) · 1.72 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
/*************************************************************************
> File Name: 1.cpp
> Author: Alan
> Mail: [email protected]
> Created Time: Sat 07 Nov 2015 10:19:04 PM PST
> Problem Name: Two Sum
> Difficulty: Medium
> Description:
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the
target, where index1 must be less than index2. Please note that your returned answers (both
index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
************************************************************************/
#include<iostream>
#include<vector>
#include<unordered_map>
using namespace std;
class Solution
{
public:
vector<int> twoSum(vector<int>& nums, int target)
{
unordered_map<int,int> mapping;
vector<int> result;
int i;
for(i = 0; i < nums.size(); i++)
{
mapping[nums[i]] = i;
}
for(i = 0; i < nums.size(); i++)
{
const int gap = target - nums[i];
if(mapping.find(gap) != mapping.end()
&& i != mapping[gap])
{
result.push_back(i + 1);
result.push_back(mapping[gap] + 1);
break;
}
}
return result;
}
};
int main()
{
Solution test = Solution();
vector<int> ivec
{
3, 2, 4
};
for(auto i : test.twoSum(ivec,6))
{
cout << i << " ";
}
cout << endl;
}