import java.util.Hashtable;
public class Solution {
public int[] twoSum(int[] numbers, int target) {
int[] index = new int[2];
//key = numbers[i] values = i
Hashtable<Integer, Integer> table = new Hashtable<Integer,Integer>();
for(int i = 0 ; i < numbers.length ; i++){
// numbers[i] 在不在 Hashtable中
if(table.get(numbers[i]) == null){
//找到
if(table.get(target - numbers[i]) != null){
index[0] = table.get(target - numbers[i])+1;
index[1] = i+1;
break;
}
table.put(numbers[i], i);
}else{
//找到
if(table.get(target - numbers[i]) != null){
index[0] = table.get(target - numbers[i])+1;
index[1] = i+1;
break;
}
}
}
return index;
}
}
Hashtable 查找时间是常数就不会超时