11.4 两数之和（哈希表）——【LeetCode】

package com.haxitable.java;

import java.util.HashMap;
import java.util.Map;

public class four {

	 public int[] twoSum(int[] nums, int target) {
		 int[] res = new int[2];
		 if(nums == null || nums.length == 0) {
			 return res;
		 }
		 Map map = new HashMap<>();
		 for(int i = 0;  i < nums.length; i++) {
			 int temp = target - nums[i];
			 if(map.containsKey(temp)) {
				 res[1] = i;
				 res[0] = map.get(temp);
			 }
			 map.put(nums[i], i);
		 }
		 return res;		 
	 }
}