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].
public class Solution {
public int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> numMap = new HashMap<>();
for (int i = 0; i < numMap.length; i++) {
int num = nums[i];
if (numMap.containsKey(num)) {
return new int[] {numMap.get(num), i};
}
numMap.put(target - num, i);
}
return null;
}
}