输入样例:
2
5 6 8 11 9
10 12 9
输出样例:
7 9
解题思路:
将序号都映射到哈希表中,并记录序号间的最大值和最小值,在遍历序号时,找出现了两次和没有出现过的数字。
Java代码:
import java.io.*;
public class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int []arr = new int[100005];
int min = Integer.MAX_VALUE;
int max = Integer.MIN_VALUE;
for(int i = 0; i < n; i++) {
String[] split = br.readLine().split(" ");
for(int j = 0; j < split.length; j++) {
int num = Integer.parseInt(split[j]);
arr[num]++;
if(num > max) max = num;
if(num < min) min = num;
}
}
int ans1 = 0, ans2 = 0;
for(int i = min; i <= max; i++) {
if(arr[i] == 0) ans1 = i;//没有出现,断号
if(arr[i] == 2) ans2 = i; //出现了两次,重号
}
System.out.println(ans1 + " " + ans2);
}
}