Two Sum - leetcode001

Problem:

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

My solution:

import java.util.*;
public class Solution{
    public int[] twoSum(int[] nums, int target){
        HashMap<Integer, Integer> hm=new HashMap<Integer, Integer>();
        int index1=-1,index2=-1;
        for(int i=0;i<nums.length;i++){
            int second=target-nums[i];
            if(hm.containsKey(second)){
                index2=i;
                index1=hm.get(second);
                break;
            }
            hm.put(nums[i],i);
        }
        return new int[]{index1+1,index2+1};
    }
}

Notes:

1、java HashMap中，key1.equals(key2),则key2的值会覆盖key1的值；key1与key2的hash值相同但key1与key2非equals，则不会覆盖，此时出现collision。

2、本题中判断一个值时，只需判断其对应的值在不在nums中，所以可以用hash快速实现。注意只能用这种先找后加的方式，不然（先都加到HashMap中）相同元素在HashMap中会覆盖。