题解 | #两数之和#

public int[] twoSum (int[] numbers, int target) {
        HashMap<Integer,Integer> map = new HashMap();

        for(int i = 0; i < numbers.length; i++){
            if(map.containsKey(target - numbers[i])){
                //target - numbers[i]存在，说明其索引在i之前
                return new int[]{map.get(target - numbers[i])+1,i+1};
            }
            map.put(numbers[i], i);
        }

        return null;
    }