题目描述: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.
测试用例:
输入:nums = [2, 7, 11, 15], target = 9
输出: return [0, 1].
题目解释:给定一个整数数组nums和一个数target,找出并返回数组中两个和刚好为target的元素的下标。
思路:遍历数组,边遍历边用map存储数组元素及其位置,若target与当前元素差值在map中,则查找成功。
代码:
public int[] twoSum(int[] nums, int target) {
int[] res = new int[2];
HashMap<Integer, Integer> set = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
if(set.isEmpty()) {
set.put(nums[i], i);
} else {
if(set.getOrDefault(target - nums[i], -1) >= 0) {
res[1] = i;
res[0] = set.get(target - nums[i]);
return res;
} else {
set.put(nums[i], i);
}
}
}
return null;
}