알고리즘
Two some_leet code #1
Daniel환
2020. 1. 22. 11:48
public int[] twoSum(int[] nums, int target) {
if(nums==null || nums.length<2) return new int[2];
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
for(int i=0; i<nums.length; i++){
if(map.containsKey(nums[i])){
return new int[]{map.get(nums[i]), i};
}else{
map.put(target-nums[i], i);
}
}
return new int[2];
}