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
Sol: Simply iterate through the array and store the (target-arr[i], i) pair into the map, search for hits and return result
package leetCode
import java.util.HashMap;
public class _2sum {
//HashMap to store target-arr[i], i.
public int[] twoSum(int[] numbers, int target) {
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
int[] resultVal = new int[2];
for(int i = 0; i < numbers.length; i ++) {
if(map.containsKey(numbers[i])) {
int index = map.get(numbers[i]);
resultVal[0] = index + 1;
resultVal[1] = i + 1;
break;
}
if(!map.containsKey(numbers[i]))
map.put(target - numbers[i], i);
}
return resultVal;
}
}