Description
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
1
2
3
4
| Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
|
Solution
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
| class Solution {
public int[] twoSum(int[] numbers, int target) {
int[] res = new int[2];
Map<Integer, Integer> map = new HashMap<Integer, Integer>();
for (int i = 0; i < numbers.length; i++) {
if (map.containsKey(target - numbers[i])) {
res[1] = i;
res[0] = map.get(target - numbers[i]);
return res;
}
map.put(numbers[i], i);
}
return res;
}
}
|