标签：
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].
UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.
Subscribe to see which companies asked this question
1 public class Solution { 2 public int[] twoSum(int[] nums, int target) { 3 Map<Integer, Integer> map = new HashMap<Integer, Integer>(); 4 int[] res = new int[2]; 5 for(int i =0;i<nums.length;i++){ 6 if(map.containsKey(target - nums[i])){ 7 res[0] = map.get(target - nums[i]); 8 res[1] = i; 9 } 10 map.put(nums[i],i); 11 } 12 return res; 13 } 14 }
标签：
原文地址：http://www.cnblogs.com/guoguolan/p/5404207.html
