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> result;
if(numbers.size()<2)
return result;
map<int,int> mapper;
for(int i=0;i<numbers.size();++i){
map<int,int>::iterator it=mapper.find(numbers[i]);
if(it!=mapper.end())//find a match number
{
result.push_back(it->second);
result.push_back(i+1);
break;
}
else {
mapper[target-numbers[i]]=i+1;
}
}
return result;
}
};
Leetcode: Two Sum
最新推荐文章于 2020-07-13 21:44:09 发布