力扣两数之和

import java.util.Arrays;
import java.util.HashMap;

/**
 * @author Luo Cancan
 * @date 2022/8/23 15:30
 */
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;
    }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31