问题描述:
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
解析:
1.暴力破解,明显会出现超时
public int[] twoSum(int[] numbers, int target) {
int[] resultInt = new int[2];
int flag=1;
int i=0,j=1;
for(i=0;i<numbers.length&&flag==1;i++)
for( j=i+1;j<numbers.length;j++){
if(numbers[i]+numbers[j]!=target)
j++;
else{
flag=0;
break;
}
}
resultInt[0]=i-1;
resultInt[1]=j;
return resultInt;
}
2.采用hashmap,网上讲解很多,直接附代码了。
public int[] twoSum(int[] numbers, int target) {
int[] resultInt = new int[2];
Map<Integer,Integer> map = new HashMap<Integer,Integer>();
for(int i=0;i<numbers.length;i++){
if(map.containsKey(numbers[i])){
int index=map.get(numbers[i]);
resultInt[0]=index+1;
resultInt[1]=i+1;
}
else{
map.put(target-numbers[i], i);
}
}
return resultInt;
}