Leetcode - Two Sum
2016-06-22 22:09
423 查看
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:
UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.
vector<int> twoSum(vector<int>& nums, int target) {
std::unordered_map<int,int> map;
vector<int> vresult;
for(int i = 0 ; i < nums.size(); i ++) {
int dif = target - nums[i];
if(map.find(dif) != map.end()) {
vresult.push_back(i);
vresult.push_back(map[dif]);
return vresult;
}
map[nums[i]] = i;
}
return vresult;
}
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.
vector<int> twoSum(vector<int>& nums, int target) {
std::unordered_map<int,int> map;
vector<int> vresult;
for(int i = 0 ; i < nums.size(); i ++) {
int dif = target - nums[i];
if(map.find(dif) != map.end()) {
vresult.push_back(i);
vresult.push_back(map[dif]);
return vresult;
}
map[nums[i]] = i;
}
return vresult;
}
相关文章推荐
- 个人总结
- Android虚线
- Problem D
- Jfinal 入门
- 【NodeJs环境下bower】如何更改bower_components文件夹的位置
- 创建com全过程
- mac上运行hadoop2.x报unable to load native-hadoop library错误
- 树中两个结点的最低公共祖先50
- [html]选项卡效果
- Hadoop源码分析——数据节点写数据2
- Android日志与DDMS
- Excel宏教程 (宏的介绍与基本使用)
- Socket 编程,一个服务器,多个客户端,互相通信
- C++ Build MessageBox将按钮的文字显示为英文
- js中style,currentStyle和getComputedStyle的区别
- 一道计算一元二次方程解的算法题
- 2016第25周三
- nginx 502 错误
- java死锁代码示例
- jQuery——jquery.fn.extend与jquery.extend