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.
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
16
17
18
19
20
21
|
public class {
public int[] twoSum(int[] numbers, int target) {
HashMap<Integer, Integer> m = new HashMap<Integer, Integer>();
for(int i = 0; i < numbers.length; i++){
m.put(target - numbers[i], i);
}
for(int i = 0; i < numbers.length; i++){
Integer v = m.get(numbers[i]);
if(v != null && v != i){
return new int[]{i + 1, v + 1};
}
}
throw new RuntimeException();
}
}
|
近期评论