两数之和

java 版本

public static int[] towSum(int[] nums,int target){

    if (nums.length == 0) return null;
    Map map = new HashMap<Integer, Integer>();
    for (int i = 0; i <nums.length ; i++) {
        if(map.containsKey(target-nums[i])){
            return new int[]{(int)map.get(target-nums[i]),i};
        }
        map.put(nums[i],i);
    }
    return null;
}

两数之和

原文：https://www.cnblogs.com/CoderRdf/p/12447271.html