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].
Personal tips:使用map key-value查找比数组高效。代码如下:
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
int m = nums.size(); vector<int> sum{};
map<int, int> num;
for (int i = 0; i < m; ++i)
{
if (num.count(target - nums[i]))
{
sum.push_back(num[target - nums[i]]);
sum.push_back(i);
return sum;
}
num.insert(pair<int, int>(nums[i], i));
}
}
};