Only one number appears once in a set of data, and the other numbers appear in pairs to find out the number

There is only one number in a set of data that appears once, and all the other numbers are paired, please find this number.

(using bit operations)

Use the XOR operation directly.

The code is as follows:

#include <stdio.h> #include <stdlib.h>int main () {int arr[]={3,5,9,2,5,3,2}; int size=sizeof (arr)/sizeof ( ARR[0]); int i=0,find=0;for (; i<size;i++) {find^=arr[i];//loop for XOR Operation}printf ("%d\n", find); System ("pause"); return 0;}

This article is from the "Materfer" blog, make sure to keep this source http://10741357.blog.51cto.com/10731357/1708445

Only one number appears once in a set of data, and the other numbers appear in pairs to find out the number