leetcode001——Two Sum
来源:互联网 发布:手机软件编程语言 编辑:程序博客网 时间:2024/05/29 16:28
一、题目描述
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
二、解题思路及代码
可以采用哈希表的方法,key记为numbers中的数字,value记为相应数字的位置,每次查看target-当前数字是否出现过即可。
代码如下(224ms)
import java.util.Hashtable;public class Solution { public int[] twoSum(int[] numbers, int target) { int[] result = new int[2]; result[0] = 0; result[1] = 0; Hashtable table = new Hashtable(); for(int i = 0; i < numbers.length; i++) { if(table.containsKey(target - numbers[i])) { result[0] = (int)table.get(target-numbers[i]) + 1; table.put(numbers[i],i); result[1] = (int)table.get(numbers[i]) + 1; } else { table.put(numbers[i],i); } } return result; }}
0 0
- leetcode001——Two Sum
- leetcode001:Two Sum
- leetcode001 Two Sum
- Two Sum - leetcode001
- Leetcode001-Two Sun
- leetcode001:3sum solution
- leetcode001-2Sum,3Sum
- LeetCode — Two Sum
- LeetCode—Two Sum
- LeetCode—Two Sum
- LeetCode1—Two Sum
- leetcode—Two Sum
- LeetCode —-Two Sum
- Sum—LeetCode-1 Two Sum
- LeetCode001
- leetcode001
- LeetCode——Two Sum
- LeetCode——Two Sum
- u-boot-2015.01移植
- 欢迎使用CSDN-markdown编辑器
- 表单属性改变时触发事件(oninput,onpropertychange,onchange)
- [记录]Java---实现简单的链表
- linux下ssd电子盘速度检测
- leetcode001——Two Sum
- 控制台参数输入类
- T.class获取
- JavaBean和POJO
- js中的constructor和prototype
- ubuntu 编写自己的ls命令
- 浅显易懂解析JNI
- rabbit MQ 3钟exchange
- ACM学习感悟——FZU2192(并查集)