题目:
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.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
我的尝试
package com.puhui.goosecard.api;
import java.util.HashMap;
import java.util.Map;
/**
* 只有一对答案,我的map方案如果有相同元素,就报错,比如3,3
**/
public class Solution {
public static int[] twoSum(int[] nums, int target) {
int rel[] = new int[2];
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
map.put(nums[i], i);
}
for (Map.Entry entry : map.entrySet()) {
int one = (Integer) entry.getKey();
if (map.containsKey(target - one) && map.get(target - one) != entry.getValue()) {
rel[0] = (Integer) entry.getValue();
rel[1] = map.get(target - one);
break;
}
}
return rel;
}
public static void main(String[] args) {
int[] nums = {3, 3};
twoSum(nums, 6);
}
}
- map无法解决重复元素,如果数组只有{3,3},我的map只有一个元素
我的错误
先看正确答案,我的思路是对的,错误在于第二次应该遍历数组而不是map。
import java.util.HashMap;
import java.util.List;
import java.util.Map;
/**只有一对答案**/
class Solution {
public int[] twoSum(int[] nums, int target) {
int rel[] = new int[2];
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 left=target-nums[i];
if(map.containsKey(left)&&map.get(left)!=i){
rel[0]=i;
rel[1]=map.get(left);
}
}
return rel;
}
}
优化为一次循环
import java.util.HashMap;
import java.util.List;
import java.util.Map;
class Solution {
public int[] twoSum(int[] nums, int target) {
int rel[] = new int[2];
Map<Integer, Integer> map = new HashMap<>();
for(int i=0;i<nums.length;i++){
int left=target-nums[i];
if(map.containsKey(left)){
rel[0]=i;
rel[1]=map.get(left);
return rel;
}
map.put(nums[i],i);
}
return rel;
}
}
总结
关键点,利用map寻找另外一个数,第一个数通过for循环依次锁定。如果包含,则返回,不包含则加入。虽然当时可能另一个数字还没有放入map,但是,当遍历到另一个数时,前一个数字已经在map里面了。