Two Sum
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
使用了hashcode快速检索元素,降低了程序的复杂度!
import java.util.Hashtable;
public class Solution {
public int[] twoSum(int[] numbers, int target) {
Hashtable<Integer,Integer> ht=new Hashtable<Integer,Integer>();
int index0=0;
int index1=0;
int val=0;
for(int i=0;i<=numbers.length;i++){
val=target-numbers[i];
if(ht.get(val)==null)
ht.put(numbers[i], i);
else{
index0=ht.get(val)+1;
index1=i+1;
break;
}
}
return new int[]{index0,index1};
}
}