1
2
3
4
5
6
7
8
9
10
11
12
13
class Solution {
public int[] twoSum(int[] nums, int target) {
HashMap<Integer, Integer> map = new HashMap<>();
for (int i = 0;i < nums.length;i++) {
if (map.containsKey(target - nums[i])) {
return new int[] {i, map.get(target-nums[i])};
} else {
map.put(nums[i], i);
}
}
return null;
}
}
