HashMap---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.

Have you met this question in a real interview? Yes
Example
numbers=[2, 7, 11, 15], target=9

return [1, 2]

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

Challenge
Either of the following solutions are acceptable:

O(n) Space, O(nlogn) Time
O(n) Space, O(n) Time

// hash map versionpublic class Solution {    /*     * @param numbers : An array of Integer     * @param target : target = numbers[index1] + numbers[index2]     * @return : [index1 + 1, index2 + 1] (index1 < index2)         numbers=[2, 7, 11, 15],  target=9         return [1, 2]     */     //哈希表    public int[] twoSum(int[] numbers, int target) {        HashMap<Integer,Integer> map = new HashMap<>();//key 是target-numbers[i]  value是数组的索引        for (int i=0; i <= numbers.length; i++) {            if (map.get(numbers[i]) != null) {                int[] result = {map.get(numbers[i]) + 1, i + 1};                return result;            }            map.put(target - numbers[i], i);        }        int[] result = {-1, -1};        return result;    }}