[LeetCode] Two Sum

풀이

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