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.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].

Solution

import java.util.HashMap;

public class Solution {

    public int[] twoSum(int[] numbers, int target) {

        if(numbers == null || numbers.length < 2) return null;

        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        for(int i = 0; i < numbers.length; i ++)
            map.put(numbers[i], i);

        for(int i = 0; i < numbers.length; i ++){
            int temp = target - numbers[i];
            if(map.containsKey(temp) && map.get(temp) != i){
                int[] result = new int[2];
                result[0] = i + 1;
                result[1] = map.get(temp) + 1;

                return result;
            }
        }

        return null;


    }
}