两数之和问题

public class TwoSum {
    public static void main(String[] args) {
        int[] nums = {2, 5, 5, 11};
        int res[] = twoSum2(nums, 10);
        System.out.println(Arrays.toString(res));
    }

    private static int[] twoSum(int[] nums, int target) {
        for (int i = 0; i < nums.length; i++) {
            for (int j = 1; j < nums.length; j++) {
                if (target - nums[i] == nums[j] && i != j) {
                    return new int[]{i, j};
                }
            }
        }
        return new int[0];
    }


    //    使用hashMap
    private static int[] twoSum2(int[] nums, int target) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(target - nums[i])) {
                return new int[]{ map.get(target-nums[i]),i};
            }
            map.put(nums[i], i);

        }

        return new int[0];
    }
}