Question

对于学校我必须创建一个打印排序数组模式的函数。它必须考虑到有多种模式，并且也没有模式。出于某种原因，即使数组中存在模式，该函数也始终打印＆＃34;无模式＆＃34;

void findMode(double *mode, double a[], unsigned int size)
{
    double number = a[0]; //Used to to compare values in the array to see if they're similar
    int count = 1; //Keeps track of number of occurences for each number
    int max = 1; //Keeps track of max number of occurences found for each number
    int uniqueNum = 1; //Keeps track of how many unique values in the array
    int maxCount = 1; //Counts how many set's of numbers occur the max ammount of times
    int elementNum = 0; //Keeps track of element number in mode array

    for (unsigned i = 1; i < size; ++i)//loop to determine how many modes and unique numbers there are
    {
        if (number == a[i])
        {
            ++count; //if the numbers the two numbers compared are the same, count is increased by 1
        }
        else
        {
            if (count == max)
            {
                ++maxCount; //Keeps track of how many modes are in the array
            }
            if (count > max)
            {
                //If the two numbers compared are not the same and the count of the previous "set" of similar numbers is higher than the current max count, max is equal to the new count
                max = count;
                maxCount = 1; //Reset the max count if a new max is found
            }
            //Count is set back to 1 as we are counting a different number
            count = 1;
            number = a[i];
            ++uniqueNum; //Unique number variable gets incremented
        }
    }

    printf("\n%d, %d, %d", max, maxCount, uniqueNum);
    count = 1; //sets count back to 1 for next loop

    if ((double)size / max == uniqueNum)
    {
        mode = malloc(1);
        mode[0] = (a[size - 1] + 1); //Returns a value that can't exist in the array there is no mode
    }
    else
    {
        mode = malloc(sizeof(double) * maxCount); //makes the mode array the right size to store all the modes
        for (unsigned i = 1; i < size; ++i)//loop to determine what the modes are
        {
            if (number == a[i])
            {
                ++count; //if the numbers the two numbers compared are the same, count is increased by 1
            }
            else
            {
                if (count == max)
                {
                    mode[elementNum] = a[i];
                    ++elementNum;
                }
                //Count is set back to 1 as we are counting a different number
                count = 1;
            }
        }

        if (mode[0] = (a[size - 1] + 1))
        {
            printf("\nMode: no mode");
        }
        else
        {
            printf("\nMode: {");
            for (int i = 0; i <= (sizeof(mode) / sizeof(mode[0])); ++i)
            {
                printf(" %.3lf ", mode[i]);
            }
            printf("}");
        }
    }

}

我不知道我离这里的正确逻辑有多远或多远，所以如果我离开并需要从头开始让我知道。

谢谢！

Answer 1

您的问题是您的比较if (mode[0] = (a[size - 1] + 1))

单=正在进行分配而非等效性测试。您将mode[0]分配给a[size -1] + 1

的值

c中的赋值运算符返回左操作数的值，因为您可以在the answer to this question中读取。在你的情况下，它将返回一个正数，它将被转换为布尔值，并且每次都被评估为真。

C查找模式的功能始终返回＆＃34;无模式＆＃34;

1 个答案: