-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path001_Two_Sum.cpp
82 lines (80 loc) · 2.03 KB
/
001_Two_Sum.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
81
82
#include<vector>
#include<iostream>
#include<map>
#include<algorithm>
#include<iterator>
using namespace std;
class Solution
{
public:
vector<int> twoSum(vector<int>& nums, int target)
{
size_t n = nums.size();
vector<int> res(2,0);
int i,j;
for(i = 0;i < n; i++)
{
for( j = 0;j < n; j++)
{
if(j!=i and nums[i]+nums[j] == target)
{
res[0]=i;
res[1]=j;
break;
}
}
}
return res;
}
vector<int> twoSum2(vector<int>& nums, int target)
{
size_t n = nums.size();
vector<int> result(2,0);
int i;
for(i = 0;i < n; i++)
{
int to_find = target-nums[i];
cout<<to_find<<endl;
auto res = find(nums.begin(),nums.end(), target-nums[i]);
auto index = distance(nums.begin(), res);
if(res != nums.end() and index != i)
{
result[0]=i;
result[1]=index;
cout<<*res<<"\t"<<i<<distance(nums.begin(), res)<<endl;
break;
}
}
return result;
}
vector<int> twoSum3(vector<int>& nums, int target)
{
size_t n = nums.size();
vector<int> result(2,0);
map<int,int> value_to_index;
int i;
for(i = 0;i < n; i++)
{
int to_find = target-nums[i];
auto res = value_to_index.find(to_find);
if(res != value_to_index.end() )
{
result[0]=i;
result[1]=value_to_index[to_find];
break;
}
value_to_index[nums[i]] = i;
}
return result;
}
};
int main(int argc, char const *argv[])
{
vector<int> nums={3,2,4};//{2,7,11,15};
Solution s;
for(auto e : s.twoSum(nums, 6))
{
cout<<e<<"\t";
}
return 0;
}