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].
给出一个数组,返回能使和=target的两个数的index
只有一个解,而且不会出现相同的元素
思路:
用一个HashMap保存(元素值,index),因为是两个数的和,和为target,如果已知一个数,那么另一个数一定为target - num
所以先按顺序保存元素,当下一个元素出现时,如果保存的元素中存在target与下一元素的差值,就找到了两个数
因为只有一个解,只要找到解,直接break
因为不是找数字,而是找index,需要从HashMap中取得
每次查看完元素后不要忘记装进HashMap
public int[] twoSum(int[] nums, int target) {
if(nums == null || nums.length == 0) {
return new int[]{};
}
HashMap<Integer, Integer> hash = new HashMap<>();
hash.put(nums[0], 0);
int[] result = new int[2];
for(int i = 1; i < nums.length; i++) {
int num = target - nums[i];
if (hash.containsKey(num)) {
result[0] = hash.get(num);
result[1] = i;
break;
}
hash.put(nums[i], i);
}
return result;
}