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, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
翻译:
给定一个整数数组,返回两个数字的索引,使它们相加得到一个给定的值。
您可以假设每个输入都只有一个解决方案,而您不会使用相同的元素两次。
例:
Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].思路:刚开始做这类题目,没有什么思路,直接看答案了,答案用HashMap来依次存数组中的数,每次循环判断map中是否有当前值的互补数。
public int[] twoSum(int[] nums, int target) {
int[] result = new int[2];
Map<Integer,Integer> map = new HashMap<Integer,Integer>();
for(int i = 0; i< nums.length;i++){
if(map.containsKey(target-nums[i])){
result[1] = i;
result[0] = map.get(target-nums[i]);
return result;
}
map.put(nums[i],i);
}
return result;
}