题解 | #两数之和#

import java.util.*;


public class Solution {
    /**
     * 
     * @param numbers int整型一维数组 
     * @param target int整型 
     * @return int整型一维数组
     */
    public int[] twoSum (int[] numbers, int target) {
        int[] res = new int[2];
        HashMap<Integer,Integer> mp = new HashMap<>();
        for(int i = 0; i < numbers.length; i++){
            if(mp.containsKey(numbers[i])){
                res[0] = mp.get(numbers[i]) + 1;
                res[1] = i + 1;
                return res;
            }else
                mp.put(target - numbers[i],i);
        }
        return null;
    }
}