寻找奇数
http://www.nowcoder.com/practice/849b9e545f4742398d278f5dc4e003d2
假设输入：a b c d e d c b a
XOR计算： a^b^c^d^e^d^c^b^a=a^a^b^b^c^c^d^d^e
=0^0^0^0^e
=e
#include <string.h>
int main()
{
int n = 0;
int ans = 0;
scanf("%d",&n);
for(int i = 0; i < n; i++)
{
int tmp = 0;
scanf("%d",&tmp);
ans ^= tmp;
}
printf("%d\n", ans);
return 0;
}
相关推荐
球球与墩墩：这不是前端常考的对象扁平化吗，面试官像是前端出来的
const flattern = (obj) => {
const res = {};
const dfs = (curr, path) => {
if(typeof curr === 'object' && curr !== null) {
const isArray = Array.isArray(curr);
for(let key in curr) {
const newPath = path ? isArray ? `${path}[${key}]` : `${path}.${key}` : key;
dfs(curr[key], newPath);
}
} else {
res[path] = curr
}
}
dfs(obj);
return res;
}
查看3道真题和解析 
