一个数组中只有两个数字是只出现一次,找出这两个数字

例如:13579135
这两个数字即为7 9

#include<stdio.h>
void findOne(int arr[8], int length) {
	int count = 0, b = arr[0];
	for (int i = 0; i < length; i++) {
		count = 0;
		b = arr[i];
		for (int j = 0; j < length; j++) {
			if (arr[j] == b) {
				count++;
			}
		}
		if (count == 1) {
			printf("%d\n", b);
		}
	}
	return 0;
}
int main() {
	int arr[8] = { 1,3,5,7,1,3,5,9 };
	int length = sizeof(arr) / sizeof(arr[0]);
	findOne(arr, length);
	system("pause");
	return 0;
}