LeetCode twoSum

[Karsonnel]

class Solution{
public:
vector twosum(vector& nums,int target)
{
int i, sum;
vector results;
map<int, int> hmap;
for(i=0; i<nums.size(); i++){
if(!hmap.count(nums[i])){
hmap.insert(pair<int, int>(nums[i], i));
}
if(hmap.count(target-nums[i])){
int n=hmap[target-nums[i]];
if(n<i){
results.push_back(n+1);
results.push_back(i+1);
//cout<<n+1<<", "<<i+1<<endl;
return results;
}

        }
    }
}

};
重点学习掌握了map 与vector 优化程序执行时间