LeetCode刷题笔记----P1两数之和
0.问题描述
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.
1.暴力
vector<int> result;
int i,j;
for(i=0;i<nums.size();i++)
{
for(j=i+1;j<nums.size();j++){
if(nums[i]+nums[j]==target){
result.push_back(i);
result.push_back(j);
return result;
}
}
}
return result;
2.哈希表
vector<int> result;
map<int,int> hash;//存储元素-下标
int i;
for(i=0;i<nums.size();i++){
if(hash.find(target-nums[i])!=hash.end()){
result.push_back(hash[target-nums[i]]);
result.push_back(i);
return result;
}
hash.insert(pair<int,int>(nums[i],i));
}
return result;
3.Vector和map的用法
vector的用法
vector<int> a;
a.push_back(3);
a.size();
a.capacity();
a[3]
map的用法
map<int,int> m;
m.insert(pair<int,int>(3,4));
m.find(3);
m[3]