C - 在插入时对链表进行排序

Question

我希望获得一些帮助，了解如何在插入时实现排序链表？下面是一个 addItem 函数，可以选择在列表的开头或末尾添加。例如，是否可以根据 var.number; 中给出的值进行插入(从而排序)？

struct structName {
    int number;
    int number2;
    char aString;
    struct structName *next;
};

struct structName *head = NULL;
struct structName *curr = NULL;
struct structName *element = NULL;

struct Struct var;

struct structName* addItem(struct structName var, bool appendList) {

    struct structName *pointer = (struct structName*)malloc(sizeof(struct structName));

    pointer->someString = var.aString;
    pointer->aNumber = var.number2;
    pointer->anotherNumber = var.number;
    pointer->next = NULL;

    if(appendList) {
        curr->next = pointer;
        curr = pointer;
    }
    else {
        pointer->next = head;
        head = pointer;
    }  

    return pointer;
}

Answer 1

很简单。如果你想插入到排序列表中。然后在插入列表之前，您必须遍历列表，直到到达列表末尾或找到大于当前列表值的节点值。然后插入您的列表。