1. Two Sum
来源:互联网 发布:大长腿知乎 编辑:程序博客网 时间:2024/06/10 01:43
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].
思路:利用哈希容器快速查找。
class Solution {public: vector<int> twoSum(vector<int> &numbers, int target){unordered_map<int, int> hash;vector<int> result;for (int i = 0; i < numbers.size(); i++) {int numberToFind = target - numbers[i];if (hash.find(numberToFind) != hash.end()) {result.push_back(hash[numberToFind]);result.push_back(i);return result;}hash[numbers[i]] = i;}return result; }};
0 0
- 1. Two Sum && 167. Two Sum II
- LeetCode 1. Two Sum
- [LeetCode]1.Two Sum
- LeetCode 1.Two Sum
- LeetCode --- 1. Two Sum
- 1.Two Sum
- [Leetcode] 1. Two Sum
- leetcode---1.Two sum
- 1.Two Sum
- [Leetcode] 1. Two Sum
- LeetCode 1.Two Sum
- 1. Two Sum
- 1. Two Sum
- 1. Two Sum Ruby
- LeetCode 1.Two Sum
- LeetCode 1.Two Sum
- 1. Two Sum
- 1.Two Sum
- Vmware 配置Ubuntu网络NAT模式,桌面网络连接是灰色的
- 前缀、中缀、后缀表达式
- ubuntu配置opencv
- iOS_推送证书流程
- Java虚拟机
- 1. Two Sum
- AndroidStudio导入工程构建慢解决办法!
- javaEE
- Java编译,运行与环境搭建
- 【MySQL】select for update 的Row Lock 与Table Lock
- Windows下安装Redis教程
- PHP变量在内存中释放问题
- Linux内核
- Swift-for循环--与OC中的比较