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