-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTwoSum.cpp
More file actions
66 lines (56 loc) · 1.25 KB
/
TwoSum.cpp
File metadata and controls
66 lines (56 loc) · 1.25 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
//[leetcode] two sum for github change test
bool compareSTB(pair<int, int> x, pair<int, int> y)
{
//(x.first < y.first);
//test
return x.first < y.first;
}
bool compareSTB2(int x, int y)
{
return x < y ;
}
class Solution {
public:
vector<int> twoSum(vector<int> &numbers, int target) {
vector<pair<int, int>> Nindex;
for (vector<int>::size_type i = 0; i!=numbers.size(); i++)
{
Nindex.push_back(make_pair(numbers[i], i));
}
sort(Nindex.begin(), Nindex.end(), compareSTB);
Nindex;
vector<int> temp;
for (vector<int>::size_type i = 0; i!=Nindex.size(); i++)
{
int sub = target - Nindex[i].first;
if (sub < 0)
continue;
int r = bsearch(Nindex, sub, i);
if (r < 0)
continue;
temp.push_back(Nindex[i].second+1);
temp.push_back(Nindex[r].second+1);
break;
}
sort(temp.begin(), temp.end(), compareSTB2);
return temp;
}
private:
int bsearch(vector<pair<int,int>>& arr, int v, int index);
};
int Solution::bsearch(vector<pair<int,int>>& arr, int v, int index)
{
int left = 0;
int right = arr.size()-1;
while (left <= right)
{
int mid = (left + right) / 2;
if (arr[mid].first == v && mid != index)
return mid;
if (arr[mid].first < v)
left = mid + 1;
else
right = mid - 1;
}
return -1;
}