public class Demo1 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int N = Integer.parseInt(sc.nextLine());
String firstStr = sc.nextLine();
sc.close();
String[] str2 = firstStr.split(" ");
int[] getsz =new int[N];
for (int i = 0; i < N; i++) {
getsz[i] = Integer.parseInt(str2[i]);
}
//拿到数组
int[] helper = new int[N];
for (int i = 0; i < N; i++) {
helper[getsz[i]]++;
}
ArrayList<Integer> li = new ArrayList<Integer>();
for (int i = 0; i < helper.length; i++) {
if (helper[i] == 1) {
li.add(i);
}
}
Collections.sort(li);
System.out.print(li.get(0)+" "+li.get(1));
}
}
位运算算法---找只出现了一次的数
最新推荐文章于 2024-07-15 22:53:16 发布