leetcode Two sum

注意下标从1开始
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int> m;
vector<int> v;
for(int i = 0; i < nums.size(); ++i)
{
int t = target - nums[i];
if(m.count(t) != 0)
{
v.push_back(m[t]);
v.push_back(i);
}
else {m[nums[i]] = i;}
}
return v;
}
};</int></int></int>