Question
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
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
Solution
1.蛮力方法(第一反应)
public class Solution {
public int[] twoSum(int[] numbers, int target) {
for (inti=0;i<nums.length;i++){
for (intj=i+1;j<nums.length;j++){
if (nums[j]==target-nums[i]){
return new int[] {i,j};
}
}
}
}
}
2.Hash Table
public class Solution {
public int[] twoSum(int[] numbers, int target) {
int[] res=new int[2];
HashMap<Integer,Integer> nums=new HashMap<Integer,Integer>(); //<key-value>
for(int i=0;i<numbers.length;i++){
nums.put(numbers[i],i);
}
for(int i=0;i<numbers.length;i++){
if(nums.containsKey(target - numbers[i]) && i != nums.get(target - numbers[i])){
res[0]=i;
res[1]=nums.get(target - numbers[i]);
}
}
return res;
}
}