Leetcode - 两数之和

@Test
public void testTwoSum() {
    int[] arrays = {3, 3};
    arrays = twoSum(arrays, 6);
    for (int i = 0; i < arrays.length; i++) {
        System.out.println(arrays[i]);
    }
}

public int[] twoSum(int[] nums, int target) {
    Map<Integer,Integer> map = new HashMap<>();
    for(int i=0;i<nums.length;i++){
        int component = target - nums[i];
        if(map.containsKey(component)){
            return new int[]{map.get(component),i};
        } else {
            map.put(nums[i],i);
        }
    }
    throw new IllegalArgumentException("error");
}