C++链表的sort

C++中链表的sort可以使用STL中的sort函数，但需要自定义比较函数。比如，如果链表节点是一个结构体，其中有一个int类型的成员变量val，那么可以这样定义比较函数：

bool cmp(ListNode* a, ListNode* b) {
    return a->val < b->val;
}

然后在sort函数中传入该比较函数即可：

sort(&head, &tail + 1, cmp);

其中head和tail分别是链表的头尾指针。

相关问题

c++用链表实现图书管理系统

链表可以用来实现图书管理系统的书籍存储和查询功能。可以定义一个Book类来表示一本书，该类包含书名、作者、ISBN号、出版社等属性。定义一个BookList类来存储所有书籍，该类包含一个链表来存储所有的Book对象。BookList类可以提供添加、删除、查找、排序等功能。

示例代码：

class Book:
    def __init__(self, title, author, isbn, publisher):
        self.title = title
        self.author = author
        self.isbn = isbn
        self.publisher = publisher

class Node:
    def __init__(self, data=None, next=None):
        self.data = data
        self.next = next

class BookList:
    def __init__(self):
        self.head = Node()

    def add_book(self, book):
        new_node = Node(book)
        cur = self.head
        while cur.next != None:
            cur = cur.next
        cur.next = new_node

    def remove_book(self, isbn):
        cur = self.head
        while cur.next != None:
            if cur.next.data.isbn == isbn:
                cur.next = cur.next.next
                return
            cur = cur.next
        print("Book not found.")

    def find_book(self, isbn):
        cur = self.head
        while cur.next != None:
            if cur.next.data.isbn == isbn:
                return cur.next.data
            cur = cur.next
        print("Book not found.")

    def display_books(self):
        cur = self.head
        while cur.next != None:
            cur = cur.next
            print("Title:", cur.data.title, "Author:", cur.data.author, "ISBN:", cur.data.isbn, "Publisher:", cur.data.publisher)

    def sort_books(self):
        books = []
        cur = self.head
        while cur.next != None:
            books.append(cur.next.data)
            cur = cur.next
        books.sort(key=lambda book: book.title)
        self.head = Node()
        for book in books:
            self.add_book(book)

使用示例：

booklist = BookList()

book1 = Book("The Great Gatsby", "F. Scott Fitzgerald", "978-0743273565", "Scribner")
book2 = Book("To Kill a Mockingbird", "Harper Lee", "978-0446310789", "Grand Central Publishing")
book3 = Book("1984", "George Orwell", "978-0451524935", "Signet Classics")

booklist.add_book(book1)
booklist.add_book(book2)
booklist.add_book(book3)

booklist.display_books()

booklist.remove_book("978-0446310789")

booklist.display_books()

booklist.find_book("978-0743273565")

booklist.sort_books()

booklist.display_books()

用c++给链表排序带主函数的

以下是一个使用C语言编写的链表排序的示例代码，包含了主函数：

#include<stdio.h>
#include<stdlib.h>

typedef struct Node {
    int data;
    struct Node* next;
} Node;

Node* createNode(int data) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}

void insertNode(Node** head, int data) {
    Node* newNode = createNode(data);
    if (*head == NULL) {
        *head = newNode;
    }
    else {
        Node* current = *head;
        while (current->next != NULL) {
            current = current->next;
        }
        current->next = newNode;
    }
}

void printList(Node* head) {
    Node* current = head;
    while (current != NULL) {
        printf("%d ", current->data);
        current = current->next;
    }
    printf("\n");
}

void swapNodes(Node *a, Node *b) {
    int temp = a->data;
    a->data = b->data;
    b->data = temp;
}

void sortList(Node* head) {
    Node* current;
    Node* index;
    if (head == NULL) {
        return;
    }
    else {
        for (current = head; current->next != NULL; current = current->next) {
            for (index = current->next; index != NULL; index = index->next) {
                if (current->data > index->data) {
                    swapNodes(current, index);
                }
            }
        }
    }
}

int main() {
    Node* head = NULL;
    insertNode(&head, 3);
    insertNode(&head, 1);
    insertNode(&head, 2);
    insertNode(&head, 5);
    insertNode(&head, 4);
    
    printf("Before sorting: ");
    printList(head);
    
    sortList(head);
    
    printf("After sorting: ");
    printList(head);
    
    return 0;
}

该程序创建了一个链表并初始化了一些节点，然后通过调用`sortList`函数对链表进行排序，最后打印排序前和排序后的链表内容。排序使用冒泡排序算法来实现，通过比较节点的数据并交换位置来完成排序。