Leetcode:Two Sum

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

题意：在一个数组中找到两个数的和为给定的target，这里需要返回其下标值。
分析：一开始以为通过先排序，再用首尾指针的思想。但题目要求的是下标而不是这两个数。推翻~
考虑HashMap，一种思想是先对这个数组每个元素进行HashMap，之后从头开始遍历，看target-nums[i]是否在HashMap中，有则返回这两个下标位置，没有则下一个 。
另一种想法：一遍Hash，对每个i，我们对target-num[i]进行Hash，这个HashMap的作用相当于为数组中的每个数a都保存另外一个数a’,使得a+a’=target。如果寻找的过程中我们发现这个HashMap contain某个元素了，说明我们就找到了这一对数。
代码如下：

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