两数之和
1.哈希法
class Solution{
public int[] twoSum(int[] nums, int target){
Map<Integer,Integer> hashtable = new HashMap<Integer,Integer>();
for(int i = 0; i<nums.length; i++){
if(hashtable.containsKey(target-nums[i])){
return new int[]{hashtable.get(target-nums[i]),i};
}
hashtable.push(nums[i],i);
}
return new int[0];
}
}