两数之和

import java.util.HashMap;

public class twoSum {
    public static int[] twoSum(int[] nums, int target) {
        HashMap<Integer,Integer> m = new HashMap();
        int res[] = new int[2];
        for (int i = 0;i<nums.length;i++){
            m.put(nums[i],i);
        }

        for (int j = 0 ; j<nums.length;j++){
            int re = target-nums[j];
            if (m.containsKey(re)&&m.get(re)!=j){//获取键为re的值  是否存在键re
                res[0]=j;
                res[1]=m.get(re);
            }

        }

        return res;
    }

}