class Solution {
public int[] twoSum(int[] nums, int target) {
HashMap<Integer,Integer> map = new HashMap<>();
for(int i =0;i< nums.length;i++){
map.put(nums[i],i);
}
for(int i =0;i< nums.length;i++){
if(map.containsKey(target-nums[i]) && i!=map.get(target-nums[i])){
return new int[]{i,map.get(target-nums[i])};
}
}
return new int[0];
}
}
For further actions, you may consider blocking this person and/or reporting abuse
Top comments (0)