0056. Two Sum

public class Solution {
    /**
     * @param numbers: An array of Integer
     * @param target: target = numbers[index1] + numbers[index2]
     * @return: [index1, index2] (index1 < index2)
     */
    public int[] twoSum(int[] numbers, int target) {
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        for(int i = 0; i<numbers.length; i++){
            map.put(numbers[i], i);
        }
        int[] result = new int[2];
        for(int i = 0; i<numbers.length; i++){
            if(map.get(target-numbers[i]) != null){
                int temp = map.get(target-numbers[i]);
                result[0] = Math.min(temp, i);
                result[1] = Math.max(temp, i);
                return result;
            }
        }
        result[0] = result[1] = -1;
        return result;
    }
}