class Solution {
public:
vector<int> twoSum(vector<int> &numbers, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<int> res;
// res.resize(2);
if (numbers.size()<=1) {
return res;
}
//sort(numbers.begin(), numbers.end());
map<int, int> mymap;
for (int i = 0; i < numbers.size(); i++) {
mymap[numbers[i]] = i;
}
for (int i = 0; i < numbers.size(); i++) {
if (mymap[target-numbers[i]] > 0 &&
mymap[target-numbers[i]] < numbers.size()) {
res.push_back(i+1);
res.push_back(mymap[target-numbers[i]]+1);
break;
}
}
return res;
}
};
public:
vector<int> twoSum(vector<int> &numbers, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<int> res;
// res.resize(2);
if (numbers.size()<=1) {
return res;
}
//sort(numbers.begin(), numbers.end());
map<int, int> mymap;
for (int i = 0; i < numbers.size(); i++) {
mymap[numbers[i]] = i;
}
for (int i = 0; i < numbers.size(); i++) {
if (mymap[target-numbers[i]] > 0 &&
mymap[target-numbers[i]] < numbers.size()) {
res.push_back(i+1);
res.push_back(mymap[target-numbers[i]]+1);
break;
}
}
return res;
}
};