0ms,高效
class Solution {
public int[] twoSum(int[] nums, int target) {
int[] res = new int[2];
HashMap<Integer,Integer> hashtable = new HashMap<Integer,Integer>();
for(int i=0;i<nums.length;i++){
//containsKey用在map,containis用在list
if(hashtable.containsKey(nums[i])){
res[1] = i;
res[0] = hashtable.get(nums[i]);
return res;
}
// 将数据存入 key为补数 ,value为下标
hashtable.put(target-nums[i], i);
}
return res;
}
}