例如：我的列表是{1,1,2,2}
然后我会有m [0] = 4 q [0] = 1
然后m [1] = 3,q [1] = 2.

所以模式是q [0] = 1;

不幸的是,到目前为止我没有成功.希望有人可以提供帮助.

float mode(int x[],int n)
{
    //Copy array and sort it
    int y[n],temp,k = 0,counter = 0,m[n],q[n];

    for(int i = 0; i < n; i++)
        y[i] = x[i];

    for(int pass = 0; pass < n - 1; pass++)
        for(int pos = 0; pos < n; pos++)
            if(y[pass] > y[pos]) {
                temp = y[pass];
                y[pass] = y[pos];
                y[pos] = temp;
            }

    for(int i = 0; i < n;){
        for(int j = 0; j < n; j++){
            while(y[i] == y[j]) {
                counter++;
                i++;
            }
        }
        m[k] = counter;
        q[k] = y[i];
        i--; //i should be 1 less since it is referring to an array subscript
        k++;
        counter = 0;
    }

}