【Leetcode】Two Sum (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

这道题是要求两个数在数组中的所在下标，所以最保险的办法是采用哈希表，不过到底哪个存为key，哪个存为value是很有技巧的

这道题如果采用左边存值，右边存键，效果会好很多

因为只要我们能得到target-A[i]所在的位置，这道题就解决了。

	public int[] twoSum(int[] numbers, int target) {
		int[] result = new int[2];
		if (numbers == null || numbers.length < 2)
			return null;
		HashMap<Integer, Integer> hashMap = new HashMap<Integer, Integer>();
		for (int i = 0; i < numbers.length; i++) {
			if (hashMap.containsKey(target - numbers[i])) {
				result[0] = hashMap.get(target - numbers[i]) + 1;
				result[1] = i + 1;
				return result;
			}
			hashMap.put(numbers[i], i);
		}
		return null;
	}