Leetcode #1

gistfile1.txt

import java.util.Hashtable;
public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        Hashtable<Integer, Integer> check = new Hashtable<Integer, Integer>();
        for(int i = 0; i<numbers.length;i++){
            if(check.containsKey(target-numbers[i]))
                return new int[]{check.get(target-numbers[i]),i+1};
            else check.put(numbers[i],i+1);
        }
        return null;
    }
}