LeetCode Two Sum

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9

Output: index1=1, index2=2

思路分析:这题O（n^2）的解法容易想到，暴力搜索sum等于target的组合。O（nlogn）的解法可以采用排序加二分查找的思路。最优解法O（n）的解法可以借助HashMap，但是需要额外O（n）的存储空间。这里给出基于HashMap查找的code。

AC Code

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        if(numbers.length < 2) return null;
        Map<Integer, Integer> numberIndexMap = new HashMap<Integer, Integer>();
        int [] res = new int[2];
        for(int i = 0; i < numbers.length; i++){
            if(numberIndexMap.containsKey(target - numbers[i])){
                if(i > numberIndexMap.get(target - numbers[i])){
                    res[0] = numberIndexMap.get(target - numbers[i]) + 1;
                    res[1] = i + 1; 
                } else {
                    res[0] = i + 1;
                    res[1] = numberIndexMap.get(target - numbers[i]) + 1; 
                }
                
                return res;
            } else {
                numberIndexMap.put(numbers[i], i);
            }
        }
        return null;
    }
}