代码如下:
#include
int main() { //异或的用法 3^3=0 0^3=3 //找出数组里面单独的数字 int arr[] = { 1,2,3,4,5,6,1,2,3,4,5,6,8 }; int i = 0; int uni_n = 0; int sz = sizeof(arr) / sizeof(arr[0]); for ( i = 0; i < sz; i++) { uni_n = uni_n ^ arr[i]; } printf("%d",uni_n); return 0; }
发布者:全栈程序员-站长,转载请注明出处:https://javaforall.net/217280.html原文链接:https://javaforall.net
