题目描述
-
英文版
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. Given nums = [2,7,11,15],target = 9, Because nums[0] + nums[i] = 2 + 7 = 9, return [0,1].
-
中文版
给定一个整数数组 nums 和一个目标值 target,请你在该数组中找出和为目标值的那 两个 整数,并返回他们的数组下标。
你可以假设每种输入只会对应一个答案。但是,你不能重复利用这个数组中同样的元素。给定 nums = [2, 7, 11, 15], target = 9 因为 nums[0] + nums[1] = 2 + 7 = 9 所以返回 [0, 1]
解题思路
我们可以使用HashMap,将数组中的值作为Key,而数组值的下标作为Value。最后只需要遍历数组,看Map中是否有target-nums[i]的值,若有则表明找到了,返回对应的下标值即可。
代码如下
package leetcode;
import java.util.HashMap;
public class TwoSum {
/**
* 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.
* Given nums = [2,7,11,15],target = 9,
* Because nums[0] + nums[i] = 2 + 7 = 9,
* return [0,1].
* time : O(N)
* space : O(N)
* @param nums
* @param target
* @return
*/
public static int[] twoSum(int[] nums,int target){
if(nums == null || nums.length < 2){
return new int[]{-1,-1};
}
int[] res = new int[]{-1,-1};
HashMap<Integer,Integer> map = new HashMap<>();
for(int i = 0 ; i < nums.length ; i++){
if(map.containsKey(target-nums[i])){
res[0] = map.get(target-nums[i]);
res[1] = i;
break;
}
map.put(nums[i],i);
}
return res;
}
public static void main(String[] args){
}
}