LeetCode 1：两数之和

哈希表

class Solution {
    public int[] twoSum(int[] nums, int target) {
    	int[] indexs = new int[2];
    	
    	HashMap<Integer, Integer> hash = new HashMap<Integer, Integer>();
    	for(int i=0; i<nums.length; ++i) {
    		if(hash.containsKey(nums[i])) {
    			indexs[1] = i;
    			indexs[0] = hash.get(nums[i]);
    			return indexs;
    		}
    		
    		hash.put(target - nums[i], i);
    	}
    	
    	return indexs;
    }
}