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].
解法:
1.暴力法:
class Solution {
public int[] twoSum(int[] nums, int target) {
int size = nums.length;
int[] result = new int[2];
for (int i = 0; i < size; i++) {
for (int j = i+1; j < size; j++) {
if(nums[i]+nums[j]==target) {
result[0] = i;
result[1] = j;
}
}
}
return result;
}
}
2.hashMap做判断容器
class Solution {
public int[] twoSum(int[] nums, int target) {
int size = nums.length;
int[] result = new int[2];
Map<Integer,Integer> contain = new HashMap<Integer,Integer>();
for(int i = 0; i<size; i++){
if(contain.get(target - nums[i]) == null){
contain.put(nums[i], i);
} else {
result[0] = i;
result[1] = contain.get(target - nums[i]);
}
}
return result;
}
}