Question

typedef struct node
{
    Record data;
    struct node *next;
}Node;

Node *head = NULL;

void addRecord(Record x)
{
    Node *previousNode = NULL;
    Node *newNode;
    Node *n;

newNode = (Node*)malloc(sizeof(Node));
newNode->data = x;
newNode->next = NULL;

if (head == NULL)  // The list is empty
{
    head = newNode;
}
else       // The list is not empty
{
    n = head;
    while (n->next != NULL)
    {
        ***if (n->data < newNode->data && n->next->data > newNode->data)*** // Insertion Sort
        {
            // We have to put it between these 2 nodes
            newNode->next = n->next;
            n->next = newNode;
            return;
        }
        else
        {
            previousNode = n;
            n = n->next;
        }
    }
    n->next = newNode;
}

}

我在插入排序的if函数中的代码中出现此错误。该计划表示＆＃39; n＆＃39;必须有算术或指针类型。什么似乎是问题？

Answer 1

C不支持运算符重载，因此除非Record为>或其他aritimetic或指针类型，否则无法使用typedef运算符进行比较int。< / p>

比较结构之类的东西，定义比较功能并使用它。

示例：

typedef struct {
    int a, b;
} Record;

/*
return positive value if *x > *y
return negative value if *x < *y
return 0 if *x == *y
*/
int cmpRecord(const Record* x, const Record* y) {
    if (x->a + x->b > y->a + y->b) return 1;
    if (x->a + x->b < y->a + y->b) return -1;
    return 0;
}

/* ... */
    while (n->next != NULL)
    {
       if (cmpRecord(&n->data, &newNode->data) < 0 && cmpRecord(&n->next->data, &newNode->data) > 0) // Insertion Sort
        {
/* ... */

C错误：表达式必须具有算术或指针类型

1 个答案: