剑指offer 数组中重复的数字

#include <iostream>
using namespace std;
class Solution {
public:
    bool duplicate(int numbers[], int length, int* duplication) {
        int table[250] = {0};
        for (int i = 0; i < length; i++){
            table[numbers[i]]++;
            if (table[numbers[i]] > 1){
                duplication[0] = numbers[i];
                return true;
            }
        }
        return false;
    }
};
int main()
{
    Solution s;
    int num[] = {2,3,1,0,2,5,3};
    int length = 7;
    int duplication;
    s.duplicate(num, length, &duplication);
    cout << duplication << endl;
    return 0;
}