力扣-01 两数之和

Given an integer array nums and an integer target value target, please find the two integers with and as the target value target in the array and return their array subscripts. You can assume that each input will correspond to only one answer. However, the same element in the array cannot be repeated in the answer. You can return answers in any order.
给定一个整数数组 nums 和一个整数目标值 target，请你在该数组中找出 和为目标值 target 的那 两个 整数，并返回它们的数组下标。你可以假设每种输入只会对应一个答案。但是，数组中同一个元素在答案里不能重复出现。你可以按任意顺序返回答案。

@Slf4j
public class Code01 {

    public static void main(String[] args) {
        int[] nums = new int[]{3, 2, 4};
        int[] result = twoSum(nums, 6);
        //预期[1,2]
        log.info(Arrays.toString(result));
    }

    public static int[] twoSum(int[] nums, int target) {
        Map<Integer, Integer> hashMap = Maps.newHashMap();
        for (int i = 0; i < nums.length; i++) {
            int dValue = target - nums[i];
            if (hashMap.containsKey(dValue)) {
                int a = hashMap.get(dValue);
                return new int[]{a, i};
            }
            hashMap.put(nums[i], i);
        }
        throw new IllegalArgumentException("No result");
    }
}