two-sum

1、来源：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

2、思路：新建一个map，然后遍历一次数组，将已有的值保存为键值，遍历的时候判断map的key是否包含（target - 当前遍历值），包含的话就找到了结果。

3、代码：

import java.util.HashMap;
import java.util.Map;
/**
 * 用map保存 （value，index），然后遍历，当前遍历下标记做i：
 *   如果 i对应的值 + map中一个value = target，即 map的key 包括target -  （i对应的值），则找到结果
 *   否则 保存map保存 （i对应的值，i）
 * @author Rail
 *
 */
public class TwoSum {
    public static void main(String[] args){
        TwoSum t = new TwoSum();
        int[] res= t.twoSum(new int[]{3,2,4}, 6);

    }

    public int[] twoSum(int[] numbers, int target) {
        Map<Integer, Integer> map = new HashMap<Integer,Integer>();
        int len = numbers.length;
        int[] index = new int[2];
        for(int i = 0; i < len; i++){
            if(!map.containsKey(target - numbers[i])){
                map.put(numbers[i], i);
            }else{
                index[0] = map.get(target - numbers[i]) + 1;
                index[1] = i + 1;
                break;
            }
        }
        return index;
    }
}