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.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[ 0] + nums[ 1] = 2 + 7 = 9,
return [ 0, 1].
Because nums[ 0] + nums[ 1] = 2 + 7 = 9,
return [ 0, 1].
思路就是使用使用map,利用下标快速查找
<div>class Solution {</div><div>public:</div><div> vector<int> twoSum(vector<int>& nums, int target) {</div><div> int i;</div><div> vector<int> results;</div><div> map<int, int> hmap;</div><div> for (i = 0; i<nums.size(); i++){</div><div> if (!hmap.count(nums[i])){</div><div> hmap.insert(pair<int, int>(nums[i], i));</div><div> }</div><div> if (hmap.count(target - nums[i])){</div><div> int n = hmap[target - nums[i]];</div><div> if (n<i){</div><div> results.push_back(n + 1);</div><div> results.push_back(i + 1);</div><div> //cout<<n+1<<", "<<i+1<<endl; </div><div> return results;</div><div> }</div><div>
</div><div> }</div><div> }</div><div> return results;</div><div> }</div><div>};</div>