LeetCode-1-Two Sum
来源:互联网 发布:stereonet软件百度云 编辑:程序博客网 时间:2024/05/29 14:31
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
主要问题是要返回元素的原始下标,如果只是返回元素本身,则可以直接将数组排序,然后从两边向中间遍历,寻找目标数;为了输出下标,建立一个map来存储。
代码如下:
class Solution {public: vector<int> twoSum(vector<int> &numbers, int target) { vector<int > result; map<int,int> temp; int len=numbers.size(); for(int i=0;i<len;i++){ int gap=target-numbers[i]; if(temp.find(gap)!=temp.end()){ result.push_back(temp[gap]); result.push_back(i+1); return result; } temp[numbers[i]]=i+1; } }};
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
- Two Sum | LeetCode(1)
- [Leetcode]1Two Sum
- leetcode 1 Two Sum
- leetcode #1 Two Sum
- leetcode 1:Two Sum
- LeetCode 1 Two Sum
- leetcode #1 two sum
- Cocos2d-x中luajit的使用
- AfxGetApp()->GetMainWnd与AfxGetMainWnd的区别
- 如何利用闪回数据库特性恢复failover 后的dataguard 环境?
- 本地音乐播放器
- 利用HASHMAP对苹果称重
- LeetCode-1-Two Sum
- C#——随机显示图片
- POJ2406 Power Strings KMP-next数组的循环节
- jenkins服务器部署(一)——用户设置工作
- UINavigationItem,UIBarButtonItem,UITabBarItem 的总结
- springMVC提交表单中文乱码???问号
- UIView控件 属性和方法详解
- 【计算机基础知识】海量字符生成与匹配实现报告
- 在Visual Studio 2010中已经找不到直接创建WebService的模板方式