题解 | #两数之和#

java采用hashf方法

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