1. Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

public class Solution {
	/*
	 * 思路：采用查找表来实现，a + b = target, 也即: a = target - b
	 * 查找表用Map来实现，其中key为数组中的值，value为元素在数组中的下标
	 * 具体做法为：
	 * 	从数组下标为0的位置开始循环，在map中进程查找，如果存在target-b，即存在a+b=target
	 *  如果不存在，则开始下一轮循环
	 */
	public int[] twoSum(int[] nums, int target) {
		Map<Integer, Integer> map = new HashMap<Integer, Integer>();
		for (int i=0; i<nums.length; i++) {
			Integer diff = target - nums[i];
			if (map.containsKey(diff)) {
				int[] resultArr = {map.get(diff), i};
				return resultArr;
			} else {
				map.put(nums[i], i);
			}
		}
		return null;
    }
}