LeetCode Two Sum
来源:互联网 发布:身份证被盗用网络贷款 编辑:程序博客网 时间:2024/05/24 04:59
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
题意:给你一个数组,告诉你有唯一解是两个数相加等于target,求下标分别是多少
思路:map离散储存,相对简单的一道题
class Solution {public: vector<int> twoSum(vector<int> &numbers, int target) { vector<int> ans; map<int, int> mp; for (int i = 0; i < numbers.size(); i++) { int tmp = target - numbers[i]; if (mp.find(tmp) != mp.end()) { ans.push_back(mp[tmp]); ans.push_back(i+1); } else mp[numbers[i]] = i+1; } return ans; }};
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
- 下载网易公开课 视频 代码
- c#微信群发消息
- OD+IDA6.1破解HideWizard v9.29(无忧隐藏)【附下载】
- Lua-编译-运行-调试
- 一个字段同时满足多个条件的查询
- LeetCode Two Sum
- 线程安全的CGContext绘图
- 分享一下我的懒惰解决了一个棘手问题
- cocos2dx3.2 创建界面菜单的简单使用
- BZOJ 2038: [2009国家集训队]小Z的袜子(hose) 分块
- Android Xfermode 实战 实现圆形、圆角图片
- WINDOWS 7 系统环境下配置JDK环境变量
- 最近要用的网址
- php 解析xml 的四种方法(转)