Two Sum

Posted on | 本文总阅读量 次

Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Solution1

Brute Force

1
2
3
4
5
6
7
8
9
10
11
12
13
14
public int[] twoSum(int[] nums, int target) {
    if (nums.length == 0) {
        return null;
    }

    for (int i = 0; i < nums.length; i++) {
        for (int j = i + 1; j < nums.length; j++) {
            if (nums[i] + nums[j] == target) {
                return new int[]{i, j};
            }
        }
    }
    return null;
}

Solution2

HashMap

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
public int[] twoSum(int[] nums, int target) {
    if (nums.length == 0) {
        return null;
    }

    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int current = nums[i];
        int expect = target - current;
        if (map.containsKey(expect)) {
            return new int[]{i, map.get(expect)};
        }
        map.put(current, i);
    }
    return null;
}