c语言分割,C语言拆分双向链表程序

冷不防 2022-10-14 10:49 172阅读 0赞

创建一个双向链表，并将此双向链表中的数据项拆分成两个双向链接的示例程序，将以下代码保存到一个源文件中：split\_doubly\_linked\_list.c， 如下所示 -

\#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 (list == NULL) \{

list = link;

return;

current = list;

// move to the end of the list

while (current->next != NULL)

current = current->next;

// Insert link at the end of the list

current->next = link;

list\_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 split\_list() \{

// Allocate memory for new node;

struct node \*listp;

struct node \*link;

struct node \*current;

listp = list;

while (listp->next != NULL) \{

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

link->data = listp->data;

link->prev = NULL;

link->next = NULL;

if (listp->data % 2 == 0) \{

if (even == NULL) \{

even = link;

even\_last = link;

listp = listp->next;

continue;

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;

listp = listp->next;

else \{

if (odd == NULL) \{

odd = link;

odd\_last = link;

listp = listp->next;

continue;

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;

listp = listp->next;

// Lets handle the last node

if (listp != NULL) \{

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

link->data = listp->data;

link->prev = NULL;

link->next = NULL;

if (listp->data % 2 == 0) \{

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 \{

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;

int main() \{

int i;

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

insert(i);

printf("Complete List : ");

printList(list);

printf("List in reverse: ");

print\_backward(list\_last);

split\_list();

printf("\\nAfter splitting list - \\n");

printf("Even : ");

printList(even);

printf("Odd : ");

printList(odd);

printf("\\nSplitted lists in reverse - \\n");

printf("Even : ");

print\_backward(even\_last);

printf("Odd : ");

print\_backward(odd\_last);

return 0;

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

Complete List :

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

List in reverse:

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

After splitting list -

Even :

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

Odd :

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

Splitted lists in reverse -

Even :

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

Odd :

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

¥ 我要打赏

纠错/补充

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

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

c语言分割,C语言拆分双向链表程序

发表评论取消回复

还没有评论，来说两句吧...

相关阅读

相关 c语言_双向链表代码

相关 C语言双向环形链表

相关 C语言双向链表

相关 c语言编程拆分用循环,C语言拆分循环链表程序

相关 C语言数据结构——双向链表

相关 C语言——链表程序

相关 c语言分割,C语言拆分双向链表程序

相关 c语言双向链表实现,双向链表(双向循环链表)的建立及C语言实现

相关数据结构（双向链表）（C语言）

相关 C语言之 - 双向链表