两数之和

class Solution {
public int[] twoSum(int[] nums, int target) {

Map map = new HashMap<>();
for(int i=0;i if(map.containsKey(target-nums[i])){
return new int[] {map.get(target-nums[i]),i};
}else{
map.put(nums[i],i);
}
}
throw new IllegalArgumentException(“No two sum solution”);
}
}