#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
int n;
int arr[N];
int ch[N*31][2], idx;//idx给树上每个节点一个编号
void trie(int x){
int p = 0;//p是当前走到了哪个节点编号
for(int i = 30; i >= 0; i--){
//取出最后一个数字
//判断0 1
int j = x>>i&1;
if(!ch[p][j]) ch[p][j] = ++idx;
p = ch[p][j];
}
}
int query(int x){
int p = 0, res = 0;
for(int i = 30; i >= 0; i--){
int j = x>>i&1;
//相反的一边
if(ch[p][!j]){
res += 1<<i;
p = ch[p][!j];
}
else p = ch[p][j];
}
return res;
}
int main(){
cin >> n;
for(int i = 1; i<=n; i++){
cin >> arr[i];
trie(arr[i]);
}
int ans = -1;
for(int i = 1; i<=n; i++){
ans = max(ans, query(arr[i]));
}
cout << ans << endl;
return 0;
}
要求 代码
# 准备数据
CREATE DATABASE IF NOT EXISTS company;USE company;CREATE TABLE IF NOT EXISTS employees(employee_id INT PRIMARY KEY,first_name VARCHAR(50),last_name VARCHAR(50),department_id INT
);DESC employees;CREATE TABLE IF NOT EXISTS departments…