【LeetCode OJ 001】Two Sum
来源:互联网 发布:淘宝网店铺装修 编辑:程序博客网 时间:2024/05/16 12:43
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) { vector<int> ret(2, -1); map<int, int> m; for (int i = 0; i < numbers.size(); i++) { if (m.find(target - numbers[i]) == m.end()) m[numbers[i]] = i; else { ret[0] = m[target - numbers[i]] + 1; ret[1] = i + 1; return ret; } } }};
0 0
- [LeetCode OJ][001]Two Sum
- 【LeetCode OJ 001】Two Sum
- LeetCode OJ:Two Sum
- LeetCode OJ : two sum
- LeetCode OJ -Two Sum
- LeetCode OJ Two Sum
- [LeetCode OJ] Two Sum
- Two Sum LeetCode OJ
- LeetCode OJ - Two Sum
- LeetCode OJ ----Two Sum
- LeetCode OJ--Two Sum
- Two Sum (LeetCode OJ)
- LeetCode OJ:Two sum
- LeetCode OJ 1Two Sum
- LeetCode OJ 01 Two Sum
- LeetCode OJ : 1 Two Sum
- LeetCode OJ 1. Two Sum
- LeetCode OJ 1. Two Sum
- FFMPEG 源码分析
- php 常用时间函数
- ERROR 1206 (HY000): The total number of locks exceeds the lock table size
- 重写与重载
- 【semi join】IN/EXISTS子查询的区别及其优化方式
- 【LeetCode OJ 001】Two Sum
- 将数字字符串转换为数字eg:“1234”->1234
- 开始
- Lua中数据类型的源码实现
- hibernate空格导致的错误!
- php 常用文件处理函数 与 文件上传
- TCP状态分析方法
- Winform窗体之间的传值
- 微信、陌陌的架构方案分析(LBS之二)