class Solution {
public int[] twoSum(int[] nums, int target) {
Map<Integer,Integer> map = new HashMap<>();
for (int i=0;i<nums.length;i++){
int num = target - nums[i];
if(map.containsKey(num)){
return new int[] {map.get(num),i};
}
map.put(nums[i],i);
}
return new int[] {};
}
}
网友评论