力扣两数之和
import java.util.Arrays;
import java.util.HashMap;
public class Sum {
public static void main(String[] args) {
int[] arr = {2, 7, 11, 15};
int target = 9;
int[] ints = new Sum().twoSum(arr, target);
System.out.println(Arrays.toString(ints));
}
public int[] twoSum(int[] nums, int target) {
HashMap<Integer, Integer> hm = new HashMap<>();
int[] ints = new int[2];
for (int i = 0; i < nums.length; i++) {
hm.put(nums[i], i);
}
for (int i = 0; i < nums.length; i++) {
if (hm.containsKey(target - nums[i]) && i != hm.get(target - nums[i])) {
ints[0] = i;
ints[1] = hm.get(target - nums[i]);
break;
}
}
return ints;
}
}
![在这里插入图片描述](https://img-blog.csdnimg.cn/5c086a83d349414aa247e13776063889.png)