题解 | #两数之和#

哈希

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> h = new HashMap<>();
        
        for(int i=0;i<numbers.length;i++){
            if(h.containsKey(numbers[i]))return new int[]{h.get(numbers[i])+1,i+1};
            h.putIfAbsent(target-numbers[i],i);
        }
        return new int[0];
    }
}