求两个数的和是否和给的目标值相等？

问题描述：

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.
Example:

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

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

代码：

/**
 * 
 */
package org.chisj.number;

import java.util.HashMap;
import java.util.Map;

/**
 * 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.
 * Example:
 * Given nums = [2, 7, 11, 15], target = 9,
 * Because nums[0] + nums[1] = 2 + 7 = 9,
 * return [0, 1].
 */

/**
 * @ClassName: TwoNumber
 * @Description: TODO
 * @Author: chisj chisj@foxmail.com
 * @Date 2016年3月11日 上午9:08:27
 *
 */
public class TwoNumber {

	public static void main(String[] args) {
		
		int a[] = {11, 7, 2, 15};
		int target = 9;
		
		//方法1：暴力遍历两次数组
		for (int i = 0; i < a.length - 1; i++) {
			for (int j = i + 1; j < a.length; j++) {
				if (a[i] + a[j] == target) {
					System.out.println("Way 1 : i = " + i + ", j = " + j);
				}
			}
		}
		
		//方法2：巧用hashmap，以空间换时间
		int c[] = twoNumber(a, target);
		System.out.println("Way 2 : i = " + c[0] + ", j = " + c[1]);
		
	}
	
	public static int[] twoNumber(int a[], int target) {
		
		int b[] = new int[2];
		
		//申请hashmap对象
		Map<Integer, Integer> m = new HashMap<Integer, Integer>();
		
		//遍历要查找的数组
		for (int i = 0; i < a.length; i++) {
			if (m.containsKey(a[i])) { //判断hashmap的键是否存在数组中
				b[0] = m.get(a[i]); //如果存在，说明hashmap的键和值的结果就是我们要找的目标和值
				b[1] = i; //hashmap的键值
				return b;
			} else {
				m.put(target - a[i], i); //如果没有，将目标值减去一个数组中的值作为键，数组下表为键值存到hashmap
			}
		}
		
		return b;
	}
	
}

结果：

Way 1 : i = 1, j = 2
Way 2 : i = 1, j = 2