leetcode--Two Sum--无序关联容器--hash map
2016-04-06 10:58
417 查看
1. Two Sum
My SubmissionsQuestion
Editorial Solution
Total Accepted: 212598 Total
Submissions: 943550 Difficulty: Easy
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].
UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.
Subscribe to see which companies asked this question
Show Tags
Show Similar Problems
Have you met this question in a real interview?
Yes
No
Discuss
#include <unordered_map>
#include <iostream>
using namespace std;
class Solution
{
public:
vector<int> twoSum(vector<int>& nums, int target) {
//sort(nums,nums.begin(),nums.end());
int aa = 0;
int bb = 0;
int indexaa = 0;
vector<int> ans;
unordered_map<int, int> numsIndex;
for (auto iterTemp1 = nums.begin(); iterTemp1 != nums.end(); ++iterTemp1)
{
aa = (*iterTemp1);
bb = target - aa;
if (numsIndex.find(bb) != numsIndex.end())
{
ans.push_back((*(numsIndex.find(bb))).second);
ans.push_back(indexaa);
//cout << (*(numsIndex.find(bb))).second<< indexaa << endl;
return ans;
}
numsIndex[aa] = indexaa;
indexaa++;
}
}
};
相关文章推荐
- TreadLocal类
- nginx学习
- BZOJ 2336: [HNOI2011]任务调度
- IPC(二)初识进程和Binder
- Python中高阶函数 map(),reduce(),filter()学习
- Leetcode 17. Letter Combinations of a Phone Number(python)
- Xcode 插件优缺点对比(推荐 20 款插件)
- @RequestBody应用
- iOS之Socket的使用-AsyncSocket
- objc的字符串变量中拼入宏
- 举例讲解设计模式中的原型模式在iOS应用开发中的作用
- [bzoj2563]阿狸和桃子的游戏
- hibernate中3个重要的类 Configuration SessionFactory Session
- java读取properties文件
- iOS开发RunTime之函数调用
- 有关copy关键字的一些问题
- sublime text 2 笔记
- 彩色的验证码
- java 度取上传 excel 文件信息,全部转换为字符串
- runtime基础篇