【LeetCode】1.Two Sum
2017-07-17 17:17
218 查看
题解:map的应用直接一次遍历注意相同元素的情况
vector<int> twoSum(vector<int>& nums, int target) {
map<int,int> mp;
vector<int> ans;
for(int i=0;i<nums.size();i++)
{
int t=nums[i];
if(mp.find(t)==mp.end()){
mp[t]=i;
}
int k=target-t;
if(mp.find(k)!=mp.end()&&mp[k]<i){
ans.push_back(mp[k]);
ans.push_back(i);
return ans;
}
}
}
vector<int> twoSum(vector<int>& nums, int target) {
map<int,int> mp;
vector<int> ans;
for(int i=0;i<nums.size();i++)
{
int t=nums[i];
if(mp.find(t)==mp.end()){
mp[t]=i;
}
int k=target-t;
if(mp.find(k)!=mp.end()&&mp[k]<i){
ans.push_back(mp[k]);
ans.push_back(i);
return ans;
}
}
}
相关文章推荐
- LeetCode-Two Sum-找和等于某个数的两个数-二分查找
- [leetcode]1. Two Sum
- Leetcode 01 Two Sum
- [leetcode, python] Two Sum 两数之和等于某数
- [leetcode]Two Sum
- 【LeetCode】C# 1、Two Sum
- [Leetcode] 1. Two Sum
- Leetcode 1——Two Sum
- LeetCode: TWO SUM
- LeetCode 1.Two Sum
- LeetCode-001 Two Sum
- LeetCode小白菜笔记[1]:Two Sum
- leetcode1 two sum
- 2017年暑期工程训练day1_leetcode_Two Sum
- leetcode 练习1 two sum
- 【leetcode】Two Sum
- [Leetcode] 1. Two Sum
- [LeetCode]1 Two Sum
- leetcode 虐我篇之(二) Two Sum
- Leetcode习题: Two Sum