Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
题目描述:给定一个数组,返回两个值相加等于给定值的数组索引。
分析:使用Hashtable或HashMap,key为数组的值,value为数组下标(即索引),循环遍历数组,判断当前数组的值是否在Hashtable里。若不在,加入Hashtable;若在,获取它的key(数组的值),然后查找Hashtable中是否有(target-当前数值)。n<i的判断是保证索引是按顺序输出的。
import java.util.Hashtable;
class Solution {
public int[] twoSum(int[] numbers, int target) {
int[] a = new int[2];
Hashtable<Integer,Integer> nums = new Hashtable<Integer,Integer>();
for(int i=0;i<numbers.length;i++){
Integer n = nums.get(numbers[i]);
if(n==null)
nums.put(numbers[i],i);
n = nums.get(target-numbers[i]);
if(n!=null&&n<i){
a[0] = n;
a[1] = i;
return a;
}
}
return a;
}
}
这是LeetCode刷的第一道题,参考了他人的解题思路,花了一定的时间理解和消化,希望能够坚持下去。