java-leetcode面试题解哈希表第1题两数之和-题解.zip

import java.util.HashMap; import java.util.Map; public class Solution2 { // 方法二：哈希表 public int[] twoSum(int[] nums, int target) { int len = nums.length; Map<Integer, Integer> hashMap = new HashMap<>(len - 1); hashMap.put(nums[0], 0); for (int i = 1; i < len; i++) { int another = target - nums[i]; if (hashMap.containsKey(another)) { return new int[]{i, hashMap.get(another)}; } hashMap.put(nums[i], i); } throw new IllegalArgumentException("No two sum solution"); } }