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.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
解:(java)
public class Solution {
public static int[] twoSum(int[] nums, int target) {
Map<Integer,Integer> numMap = new HashMap<Integer,Integer>();
for (int i = 0; i < nums.length; i++) {
numMap.put(nums[i],i);
//值- -i
}
Set keys = numMap.keySet();
int [] ret = new int[2];
for (Iterator iterator = keys.iterator();iterator.hasNext();){
Integer key = (Integer) iterator.next();
if (keys.contains(target-key)&&key<(target-key)){
if(numMap.get(key) != numMap.get(target-key)) {
ret[0] = numMap.get(key);
ret[1] = numMap.get(target - key);
}
}
}
return ret;
}
public static void main(String[] args){
int[] nums = {0,7,11,0};
int target = 0;
int[] res = twoSum(nums,target);
}
}
这个实现没有考虑到一个问题:即给定的数组中存在两数相同{0,7,11,0},目标数为0。由于Hashmap的键值不能重复,重复会自动覆盖,这样的话,在给map赋值的时候,就剩3个值了(0,7,11)。
改进:
public class Solution {
public static int[] twoSum(int[] nums, int target) {
int [] ret = new int[2];
Map<Integer,Integer> numMap = new HashMap<Integer,Integer>();
for (int i = 0; i < nums.length; i++) {
if(numMap.get(nums[i])!=null){
ret[0] = numMap.get(nums[i]);
ret[1] = i;
break;
}
numMap.put((target-nums[i]),i);
//值- -i
}
return ret;
}
public static void main(String[] args){
int[] nums = {0,7,11,0};
int target = 0;
int[] res = twoSum(nums,target);
}
}
思想:判断当前map中是否存在nums[i],存在,即返回nums[i]对应的map中的value 和当前的i ,不存在则将(target-nums[i])作为key,i作为value存入map中。