问题描述
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.
大概的意思就是给定一个数组和一个目标值,数组中必只有2个数字加起来刚好是目标值,得到这2个数字的下标并返回。
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
先提供最简单的思路,2层循环处理:
public class Solution {
public int[] twoSum(int[] nums, int target) {
int m = 0 ,n = 0;
outer: for(int i = 0;i < nums.length;i++)
{
for(int j = i+1; j < nums.length;j++){
if(nums[i] + nums[j] == target){
m = i;
n = j;
break outer;
}
}
}
return new int[]{m,n};
}
}
这样的效率很低,一般来说,这种两层循环解决的事情用一层循环应该也可以解决,无非是多开点空间而已,而题目的tag中有hashMap。
遍历数组的时候,可以看看target和当前选取值的差值是否在数组中,而用hashmap.containsKey就可以解决这个问题了,当然还要考虑这个差值不能是当前选取的值。
public int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
map.put(nums[i], i);
}
for (int i = 0; i < nums.length; i++) {
int complement = target - nums[i];
if (map.containsKey(complement) && map.get(complement) != i) {
return new int[] { i, map.get(complement) };
}
}
throw new IllegalArgumentException("No two sum solution");
}