LeetCode : Two Sum
来源:互联网 发布:房地产知乎 编辑:程序博客网 时间:2024/06/15 22:53
第一种方法是直接双指针遍历。
第二种方法是向哈希表中记录。
vector<int> twoSum(vector<int>& nums, int target){ vector<int> res; map<int, int> rec; for(int i = 0; i < nums.size(); i++) { if(rec.find(nums[i]) != rec.end()) { res.push_back(rec[nums[i]]); res.push_back(i); return res; } rec[target - nums[i]] = i; } return res;}
0 0
- 【Leetcode】Two Sum (Sum)
- LeetCode: Two Sum
- LeetCode: Two Sum
- [Leetcode] Two Sum
- LeetCode : Two Sum
- Leetcode: Two Sum
- leetcode 46: Two Sum
- [LeetCode] Two Sum
- LeetCode 1 - Two Sum
- Leetcode : Two Sum
- 【leetcode】Two Sum
- [LeetCode]Two Sum
- leetcode Two Sum
- [Leetcode] Two Sum
- [leetcode] Two Sum
- LeetCode - Two Sum
- leetcode之Two Sum
- LeetCode | Two Sum
- Android Studio常用快捷键大全
- CentOS6.x 源码编译安装Git
- 2016 ICPC 北京网络赛F题Periodic Signal,hiho1388 : Periodic Signal
- Android悬浮缩放菜单的实现【转】
- java基础(二)-数据类型
- LeetCode : Two Sum
- 【考研日记】:远离垃圾人与努力的状态
- spring使用总结
- 数据访问层概要设计
- PTAM与PTAMM
- LintCode:数组剔除元素之后的乘积
- 反射与构造方法(4)
- Hdu 5876 Sparse Graph(补图最短路)
- 题目1010:A + B