题解 | #两数之和#

import java.util.*;


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