题解 | 两数之和
两数之和
https://www.nowcoder.com/practice/20ef0972485e41019e39543e8e895b7f
import java.util.*;
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param numbers int整型一维数组
* @param target int整型
* @return int整型一维数组
*/
public int[] twoSum (int[] numbers, int target) {
// write code here
Map<Integer, Integer> map = new HashMap<>();
int[] yb = new int[2];
for (int i=0;i<numbers.length; i++) {
int val = numbers[i];
if (map.containsKey(val)) {
yb[0] = map.get(val);
yb[1] = i+1;
break;
}
int key = target - val;
if (!map.containsKey(key)) {
map.put(key, i+1);
}
}
return yb;
}
}

查看13道真题和解析