1. Two Sum
Easy
11426392FavoriteShare
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
Accepted
1,994,600
Submissions
4,494,814
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int ,int>m;
vector<int> res;
for(int i=0;i<nums.size();++i)
{
int t =target-nums[i];
if(m.count(t)&&m[t]!=i){
res.push_back(i);
res.push_back(m[t]);
break;
}
m[nums[i]]=i;
}
return res;
}
};