用c语言实现两个链表的链接,C语言连接合并两个双向链表程序

创建两个双向链表，并连接这两双向链表中的数据项连接合并成一个双向链接的示例程序，将以下代码保存到一个源文件中：combine_two_doubly_linked_list.c， 如下所示 -

#include

#include

struct node {

int data;

struct node *prev;

struct node *next;

};

struct node *list = NULL;

struct node *list_last = NULL;

struct node *even = NULL;

struct node *even_last = NULL;

struct node *odd = NULL;

struct node *odd_last = NULL;

struct node *current = NULL;

//Create Linked List

void insert(int data) {

// Allocate memory for new node;

struct node *link = (struct node*) malloc(sizeof(struct node));

link->data = data;

link->prev = NULL;

link->next = NULL;

// If head is empty, create new list

if (data % 2 == 0) {

if (even == NULL) {

even = link;

return;

}

else {

current = even;

while (current->next != NULL)

current = current->next;

// Insert link at the end of the list

current->next = link;

even_last = link;

link->prev = current;

}

}

else {

if (odd == NULL) {

odd = link;

return;

}

else {

current = odd;

while (current->next != NULL)

current = current->next;

// Insert link at the end of the list

current->next = link;

odd_last = link;

link->prev = current;

}

}

}

//display the list

void print_backward(struct node *head) {

struct node *ptr = head;

printf("\n[last] <=>");

//start from the beginning

while (ptr != NULL) {

printf(" %d <=>", ptr->data);

ptr = ptr->prev;

}

printf(" [head]\n");

}

//display the list

void printList(struct node *head) {

struct node *ptr = head;

printf("\n[head] <=>");

//start from the beginning

while (ptr != NULL) {

printf(" %d <=>", ptr->data);

ptr = ptr->next;

}

printf(" [last]\n");

}

void combine() {

struct node *link;

list = even;

link = list;

while (link->next != NULL) {

link = link->next;

}

link->next = odd;

odd->prev = link;

// assign link_last to last node of new list

while (link->next != NULL) {

link = link->next;

}

list_last = link;

}

int main() {

int i;

for (i = 1; i <= 10; i++)

insert(i);

printf("Even : ");

printList(even);

printf("Even (R): ");

print_backward(even_last);

printf("Odd : ");

printList(odd);

printf("Odd (R) : ");

print_backward(odd_last);

combine();

printf("Combined List :\n");

printList(list);

printf("Combined List (R):\n");

print_backward(list_last);

return 0;

}

执行上面程序，得到以下结果 -

Even :

[head] <=> 2 <=> 4 <=> 6 <=> 8 <=> 10 <=> [last]

Even (R):

[last] <=> 10 <=> 8 <=> 6 <=> 4 <=> 2 <=> [head]

Odd :

[head] <=> 1 <=> 3 <=> 5 <=> 7 <=> 9 <=> [last]

Odd (R) :

[last] <=> 9 <=> 7 <=> 5 <=> 3 <=> 1 <=> [head]

Combined List :

[head] <=> 2 <=> 4 <=> 6 <=> 8 <=> 10 <=> 1 <=> 3 <=> 5 <=> 7 <=> 9 <=> [last]

Combined List (R):

[last] <=> 9 <=> 7 <=> 5 <=> 3 <=> 1 <=> 10 <=> 8 <=> 6 <=> 4 <=> 2 <=> [head]

¥ 我要打赏

纠错/补充

收藏

加QQ群啦，易百教程官方技术学习群

注意：建议每个人选自己的技术方向加群，同一个QQ最多限加 3 个群。