题解 | #两数之和#

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];
        Map<Integer, Integer> map = new HashMap<>();

        for (int i = 0; i < numbers.length; i++) {
            
            Integer val = map.get(target - numbers[i]);
            if (val != null && val != i) {
                //这样val 一定是前面的
                res[0] = val + 1;
                res[1] = i + 1;
                return res;
            }
            map.put(numbers[i], i);
        }

        return res;
    }
}