p113_9.cpp

常用算法代码

#include <iostream>
using namespace std;
int Find(int array[], int n) {
    if (n > 1) {
        int find = 0;
        for (int i = 0; i < n - 1; i += 2)
            array[i] == array[i+1] ? array[find++] = array[i] : 0;
            i == n-1 ? array[find++] = array[n-1] : 0;
        return Find(array, find);
    }
    return array[0];
}

int main() {
	int n = 8;
	int a[] = {2,2,2,5,5,5,5,5};
	cout<<Find(a,8)<<endl;
	return 0;
}