public int[] twoSum(int[] numbers, int target) {
int []ans = new int[2];
Hashtable<Integer, Integer> table = new Hashtable<Integer, Integer>();
for (int i = 0; i < numbers.length; i++) {
Integer num = table.get(numbers[i]);
if(num == null) table.put(numbers[i], i);
num = table.get(target - numbers[i]);
if(num != null && num < i){
ans[0] = num + 1;
ans[1] = i + 1;
//System.out.println("i = " + i);
return ans;
}
}
//System.out.println("for end");
return ans;
}
思路:将数组遍历一次,并numbers[i]将其存放在HashTable中(注意:键值对中的键是numbers[i],值是i),如果在HashTable之前没有存在的话,就存进HashTable,并且查找HashTable中是否有target-numbers[i],如果有则直接结束。否则继续遍历