two-sum
来源:互联网 发布:cmd查找他机mac 编辑:程序博客网 时间:2024/06/05 00:39
题目:
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
程序:
class Solution {public: vector<int> twoSum(vector<int> &numbers, int target) { map<int, int> m; vector<int> ret; for (int i = 0; i < numbers.size(); i++) m[numbers[i]] = i; for (int i = 0; i < numbers.size(); i++) { if (m.find(target - numbers[i]) != m.end()&&m[target-numbers[i]]>i) { ret.push_back(i + 1); ret.push_back(m[target - numbers[i]] + 1); break; } } return ret; }};
阅读全文
0 0
- Two Sum
- Two Sum
- Two Sum
- two sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- 线性代数的本质(Essense Of Linear Algebra)[4]
- 513. Find Bottom Left Tree Value
- pat 乙级 1040. 有几个PAT(25)
- navicat for mysql 10.0.11 简体免安装中文破解版
- 倍增法求最近公共祖先 lca
- two-sum
- Matlab 定义函数的几种方法
- 练习2
- 9.6 今天学到了什么
- Android学习资源
- 一脸懵逼学习oracle(图形化界面操作---》PLSQL图形化界面)
- 【深入理解JVM】:类加载器与双亲委派模型
- NOIP2014 lgP2312 解方程(秦九韶算法+hash)
- HDOJ HDU 1028 Ignatius and the Princess III