我想換一個雙向鏈表的第一個和最後一個元素交換第一和最後一個元素。到目前爲止,我有下面的代碼,我創建一個列表並添加一些數字。但是兩次輸出都是相同的列表。內C - 雙向鏈表
#include <stdio.h>
#include <stdlib.h>
struct node2 {
int number;
struct node2 *next, *prev;
};
void addNodeDouble(struct node2 **head, struct node2 **tail, int num, int thesi) {
if (*head == NULL) {
struct node2 * current;
current = (struct node2 *)malloc(1 * sizeof(struct node2));
current->number = num;
current->prev = NULL;
current->next = NULL;
*head = current;
*tail = current;
} else {
if (thesi == 1) {
struct node2 *current, *temp;
current = (struct node2 *)malloc(1 * sizeof(struct node2));
current->number = num;
temp = *head;
while (temp->next != NULL)
temp = temp->next;
temp->next = current;
current->prev = *tail;
current->next = NULL;
(*tail)->next = current;
*tail = current;
} else {
struct node2 *current;
current = (struct node2 *)malloc(1 * sizeof(struct node2));
current->number = num;
current->next = *head;
(*head)->prev = current;
*head = current;
}
}
}
void ReversedisplayList(struct node2 **head, struct node2 **tail) {
struct node2 *current;
if (*head == NULL)
printf("I lista einai adeia!\n");
else {
current = *tail;
while (current != NULL) {
printf("%d ", current->number);
current = current->prev;
}
}
}
void swapElements2(struct node2 **head, struct node2 **tail) {
struct node2 *current, *temp;
temp = (*tail)->prev;
current = *tail;
temp->next = *head;
current->next = (*head)->next;
(*head)->next = NULL;
*head = current;
}
int main() {
struct node2 *head, *tail;
head = tail = NULL;
addNodeDouble(&head, &tail, 4, 1);
addNodeDouble(&head, &tail, 8, 1);
addNodeDouble(&head, &tail, 3, 0);
addNodeDouble(&head, &tail, 1, 1);
addNodeDouble(&head, &tail, 7, 0);
printf("\n\nDoubly linked list (reversed): ");
ReversedisplayList(&head, &tail);
swapElements2(&head, &tail);
printf("\nChanged list: ");
ReversedisplayList(&head, &tail);
}
我得到:
Doubly linked list (reversed): 1 8 4 3 7
Changed list: 1 8 4 3 7
但我想:
Changed list: 7 8 4 3 1
您可能需要考慮交換節點的數據而不是節點本身。在這種情況下,這會讓你更容易。 – Hypino
@Hypino不,其實我是想交換節點 – user3120283