题解 | #两数之和#
两数之和
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
int [] res = new int[2];
Map<Integer, Integer> map = new HashMap<>();
for(int i = 0; i<numbers.length; i++) {
if(map.containsKey(numbers[i])) {
res[0] = map.get(numbers[i]) + 1;
res[1] = i + 1;
} else {
map.put((target - numbers[i]), i);
}
}
String result = "";
for(int i = 0; i< res.length; i++) {
String element = String.valueOf(res[i]);
result += element;
if( i != res.length - 1) {
result += ",";
}
}
System.out.println(result);
return res;
}
}
查看19道真题和解析
