leetcode 1. Two Sum
来源:互联网 发布:家庭音响系统知乎 编辑:程序博客网 时间:2024/06/18 00:39
相关问题
1. Two Sum
15. 3Sum
16. 3Sum Closest
18. 4Sum
454. 4Sum II
Discription
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, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums1 = 2 + 7 = 9,
return [0, 1].
思路
哈希表
遍历过程中使用哈希表记录每个出现的元素。如果其“互补”元素已经出现,则构成一组解。
时间复杂度:
空间复杂度:
代码
class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> res; unordered_map<int, int> hash; for (int i = 0; i < nums.size(); i++) { int val = target - nums[i]; if (hash.find(val) == hash.end()) hash[nums[i]] = i; else { res.push_back(i); res.push_back(hash[val]); } } return res; }};
阅读全文
0 0
- LeetCode 1. Two Sum
- [LeetCode]1.Two Sum
- LeetCode 1.Two Sum
- LeetCode --- 1. Two Sum
- [Leetcode] 1. Two Sum
- leetcode---1.Two sum
- [Leetcode] 1. Two Sum
- LeetCode 1.Two Sum
- LeetCode 1.Two Sum
- LeetCode 1.Two Sum
- 【LeetCode]1.Two Sum
- LeetCode 1.Two Sum
- leetcode 1. Two Sum
- [leetcode] 1. Two Sum
- leetcode 1. Two Sum
- Leetcode- 1. Two Sum
- LeetCode-1.Two Sum
- Leetcode 1. Two Sum
- dubbo+zipkin的服务跟踪
- Socket通信介绍
- 随机色产生的宏
- Flex 学习之路之二 Flex 与Java的交互
- ios-自定义转场动画基础
- leetcode 1. Two Sum
- tomcat + jenkins +windows
- 06.类的加载器二(创建自己的类加载器)
- 在浏览器输入网址时发生了什么
- 如何更好处理数据仓库服务必然需要云数据库HybridDBforPostgreSQL
- 2017/10/7模拟赛总结
- git 常用命令
- ntp时间同步
- 接口测试之基于LoadRunner的一个简单示例