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].
hash。用一个哈希表,存储每个数对应的下标,复杂度 O(n)
class Solution {
public int[] twoSum(int[] nums, int target) {
int[] res = new int[2];
HashMap<Integer, Integer> myMap = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
myMap.put(nums[i], i);
}
for (int i = 0; i < nums.length; i++) {
Integer v = myMap.get(target - nums[i]);
if (v != null && v > i) {
res[0] = i;
res[1] = v;
}
}
return res;
}
}