*[Lintcode]Two Sum 两数之和
来源:互联网 发布:尤克里里调音软件 安卓 编辑:程序博客网 时间:2024/05/17 07:36
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.
numbers=[2, 7, 11, 15]
, target=9
return [1, 2]
- O(n) Space, O(nlogn) Time
- O(n) Space, O(n) Time
public class Solution { /* * @param numbers : An array of Integer * @param target : target = numbers[index1] + numbers[index2] * @return : [index1 + 1, index2 + 1] (index1 < index2) */ public int[] twoSum(int[] numbers, int target) { HashMap<Integer, Integer> res = new HashMap<Integer, Integer>(); for(int i = 0; i < numbers.length; i++) { if(res.containsKey(numbers[i])) { return new int[]{res.get(numbers[i]) + 1, i + 1}; } else { res.put(target - numbers[i], i); } } return new int[]{}; }}
0 0
- *[Lintcode]Two Sum 两数之和
- lintcode 两数之和(Two Sum )(Java)
- Two Sum--两数之和
- Two sum 两数之和
- LeetCode Two Sum 两数之和
- leetcode 1 Two Sum 两数之和
- Two Sum(两数之和)
- LeetCode-Two Sum(两数之和)
- 1、Two Sum(两数之和)
- Lintcode 两数之和
- LintCode 两数之和
- LintCode-两数之和
- LintCode 两数之和
- lintcode--两数之和
- lintcode 两数之和
- LintCode-两数之和
- LintCode 两数之和
- [leetcode, python] Two Sum 两数之和等于某数
- SPDY协议 - v3
- C语言的输入输出模型
- textarea回车符 \r\n 在各个浏览器中表现
- Git常用命令总结2
- c#第五章指导学习:库存管理
- *[Lintcode]Two Sum 两数之和
- CI框架源码解析二十之文件上传类文件Upload.php
- 配置文件configSections节点使用实例 。
- 玩乐购与京东天猫深度合作 打造云购全网最低价
- css3 关于scaleborder
- python zip函数
- Java 分支结构 - if...else/switch
- FAQ13620]L版本AAL功能(2)——L版本AAL新架构
- Android状态栏微技巧,带你真正理解沉浸式模式