[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

关键思想是利用Hash表来保存数字和index的关系：

package com.foo.leetcode.string;

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

/*
 * 描述
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
 * */
public class TwoSum {

	public static int [] findTwoSum(int[] input, int targetSum){
		
		Map<Integer,Integer> data = new HashMap<Integer, Integer>();
		int [] result = new int[2];
		for(int i=0; i<input.length; i++){
			data.put(input[i],i);			
		}
		
		for(int i=0 ; i<input.length; i++){
			
			int tmp = input[i];
			
			if(data.containsKey(targetSum-tmp)){
				result[0] = i;
				result[1]= data.get(targetSum-tmp);				
				break;
			}
		}
		
		return result;
	}
	public static void main(String[] args) {
		int[] input = new int[]{1,3,4,5,6,7,8,9};
		int[] result = TwoSum.findTwoSum(input, 11);
		System.out.println("test twoSum:" + result[0] +" "+ result[1]);
	}
}