public static int[] twoSum(int[] numbers, int target) {
        // write your code here
        int[]A=numbers;
        int t=target;
        Map<Integer,Integer> map=new HashMap<>();
        for (int i=0;;++i) {
            Integer val=map.get(t-A[i]);
            if (val!=null)
                return new int[]{val, i+1};
            if (!map.containsKey(A[i]))
                map.put(A[i], i+1);
        }
    }