#include <stdio.h>
#include <stdlib.h>
?
// 雙向鏈表節(jié)點(diǎn)結(jié)構(gòu)
typedef struct Node {
 ? ?int data; ? ? ? ? ? ? ?// 數(shù)據(jù)域
 ? ?struct Node* prev; ? ? // 指向前一個(gè)節(jié)點(diǎn)的指針
 ? ?struct Node* next; ? ? // 指向后一個(gè)節(jié)點(diǎn)的指針
} Node;
?
// 創(chuàng)建新節(jié)點(diǎn)
Node* createNode(int data) {
 ? ?Node* newNode = (Node*)malloc(sizeof(Node));
 ? ?if (newNode == NULL) {
 ? ? ? ?printf("Failed to allocate memory for new node\n");
 ? ? ? ?return NULL;
 ?  }
 ? ?newNode->data = data;
 ? ?newNode->prev = NULL;
 ? ?newNode->next = NULL;
 ? ?return newNode;
}
?
// 在鏈表末尾添加節(jié)點(diǎn)
void append(Node** head, int data) {
 ? ?Node* newNode = createNode(data);
 ? ?if (newNode == NULL) {
 ? ? ? ?return;
 ?  }
 ? ?if (*head == NULL) {
 ? ? ? ?*head = newNode;
 ?  } else {
 ? ? ? ?Node* current = *head;
 ? ? ? ?while (current->next != NULL) { ? ?// 找到鏈表末尾
 ? ? ? ? ? ?current = current->next;
 ? ? ?  }
 ? ? ? ?current->next = newNode;
 ? ? ? ?newNode->prev = current;
 ?  }
}
?
// 在鏈表頭部添加節(jié)點(diǎn)
void prepend(Node** head, int data) {
 ? ?Node* newNode = createNode(data);
 ? ?if (newNode == NULL) {
 ? ? ? ?return;
 ?  }
 ? ?if (*head == NULL) {
 ? ? ? ?*head = newNode;
 ?  } else {
 ? ? ? ?newNode->next = *head;
 ? ? ?  (*head)->prev = newNode;
 ? ? ? ?*head = newNode;
 ?  }
}
?
// 在指定位置插入節(jié)點(diǎn)
void insert(Node** head, int data, int position) {
 ? ?if (position < 0) {
 ? ? ? ?printf("Invalid position\n");
 ? ? ? ?return;
 ?  }
 ? ?if (position == 0) {
 ? ? ? ?prepend(head, data);
 ? ? ? ?return;
 ?  }
 ? ?Node* newNode = createNode(data);
 ? ?if (newNode == NULL) {
 ? ? ? ?return;
 ?  }
 ? ?Node* current = *head;
 ? ?int count = 0;
 ? ?while (count < (position - 1) && current != NULL) { ? ?// 找到插入位置前一個(gè)節(jié)點(diǎn)
 ? ? ? ?current = current->next;
 ? ? ? ?count++;
 ?  }
 ? ?if (current == NULL) {
 ? ? ? ?printf("Invalid position\n");
 ? ? ? ?free(newNode);
 ? ? ? ?return;
 ?  }
 ? ?newNode->next = current->next;
 ? ?newNode->prev = current;
 ? ?if (current->next != NULL) {
 ? ? ? ?current->next->prev = newNode;
 ?  }
 ? ?current->next = newNode;
}
?
// 刪除指定位置的節(jié)點(diǎn)
void removeAt(Node** head, int position) {
 ? ?if (*head == NULL) {
 ? ? ? ?printf("List is empty\n");
 ? ? ? ?return;
 ?  }
 ? ?if (position < 0) {
 ? ? ? ?printf("Invalid position\n");
 ? ? ? ?return;
 ?  }
 ? ?Node* current = *head;
 ? ?int count = 0;
 ? ?if (position == 0) {
 ? ? ? ?*head = current->next;
 ? ? ? ?if (*head != NULL) {
 ? ? ? ? ?  (*head)->prev = NULL;
 ? ? ?  }
 ? ? ? ?free(current);
 ? ? ? ?return;
 ?  }
 ? ?while (count < position && current != NULL) { ? ?// 找到要?jiǎng)h除的節(jié)點(diǎn)
 ? ? ? ?current = current->next;
 ? ? ? ?count++;
 ?  }
 ? ?if (current == NULL) {
 ? ? ? ?printf("Invalid position\n");
 ? ? ? ?return;
 ?  }
 ? ?current->prev->next = current->next;
 ? ?if (current->next != NULL) {
 ? ? ? ?current->next->prev = current->prev;
 ?  }
 ? ?free(current);
}
?
// 修改指定位置的節(jié)點(diǎn)值
void modify(Node* head, int position, int data) {
 ? ?Node* current = head;
 ? ?int count = 0;
 ? ?while (count < position && current != NULL) { ? ?// 找到要修改的節(jié)點(diǎn)
 ? ? ? ?current = current->next;
 ? ? ? ?count++;
 ?  }
 ? ?if (current == NULL) {
 ? ? ? ?printf("Invalid position\n");
 ? ? ? ?return;
 ?  }
 ? ?current->data = data;
}
?
// 對(duì)鏈表進(jìn)行排序
void sort(Node** head) {
 ? ?if (*head == NULL) {
 ? ? ? ?printf("List is empty\n");
 ? ? ? ?return;
 ?  }
 ? ?Node* current = *head;
 ? ?Node* temp = NULL;
 ? ?int swapped;
 ? ?do {
 ? ? ? ?swapped = 0;
 ? ? ? ?current = *head;
 ? ? ? ?while (current->next != NULL) {
 ? ? ? ? ? ?if (current->data > current->next->data) {
 ? ? ? ? ? ? ? ?int tmp = current->data;
 ? ? ? ? ? ? ? ?current->data = current->next->data;
 ? ? ? ? ? ? ? ?current->next->data = tmp;
 ? ? ? ? ? ? ? ?swapped = 1;
 ? ? ? ? ?  }
 ? ? ? ? ? ?current = current->next;
 ? ? ?  }
 ? ? ? ?temp = current;
 ?  } while (swapped);
}
?
// 打印鏈表
void printList(Node* head) {
 ? ?if (head == NULL) {
 ? ? ? ?printf("List is empty\n");
 ? ? ? ?return;
 ?  }
 ? ?Node* current = head;
 ? ?while (current != NULL) {
 ? ? ? ?printf("%d ", current->data);
 ? ? ? ?current = current->next;
 ?  }
 ? ?printf("\n");
}
?
// 釋放鏈表內(nèi)存
void freeList(Node** head) {
 ? ?if (*head == NULL) {
 ? ? ? ?return;
 ?  }
 ? ?Node* current = *head;
 ? ?Node* next = NULL;
 ? ?while (current != NULL) {
 ? ? ? ?next = current->next;
 ? ? ? ?free(current);
 ? ? ? ?current = next;
 ?  }
 ? ?*head = NULL;
}
?
int main() {
 ? ?Node* head = NULL;
 ? ?append(&head, 5);
 ? ?append(&head, 3);
 ? ?prepend(&head, 9);
 ? ?insert(&head, 7, 1);
 ? ?removeAt(&head, 2);
 ? ?modify(head, 0, 2);
 ? ?sort(&head);
 ? ?printList(head);
 ? ?freeList(&head);
 ? ?return 0;
}

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