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

骑猪看日落 2023-01-22 14:49 139阅读 0赞

创建一个循环链表，并将这个循环链表拆分成为两个循环链表的示例程序，将以下代码保存到一个源文件中：split\_circular\_linked\_list.c， 如下所示 -

\#include

struct node \{

int data;

struct node \*next;

\};

struct node \*even = NULL;

struct node \*odd = NULL;

struct node \*list = NULL;

//Create Linked List

void insert(int data) \{

// Allocate memory for new node;

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

struct node \*current;

link->data = data;

link->next = NULL;

if (list == NULL) \{

list = link;

list->next = link;

return;

current = list;

while (current->next != list)

current = current->next;

// Insert link at the end of the list

current->next = link;

link->next = list;

void display(struct node \*head) \{

struct node \*ptr = head;

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

//start from the beginning

while (ptr->next != head) \{

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

ptr = ptr->next;

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

printf(" \[head\]\\n");

void split\_list() \{

int count = 0;

// Allocate memory for new node;

struct node \*list1;

struct node \*link;

struct node \*current;

list1 = list;

while (list1->next != list) \{

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

link->data = list1->data;

link->next = NULL;

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

if (even == NULL) \{

even = link;

even->next = link;

list1 = list1->next;

continue;

else \{

current = even;

while (current->next != even) \{

current = current->next;

// Insert link at the end of the list

current->next = link;

link->next = even;

list1 = list1->next;

else \{

if (odd == NULL) \{

odd = link;

odd->next = link;

list1 = list1->next;

continue;

else \{

current = odd;

while (current->next != odd) \{

current = current->next;

// Insert link at the end of the list

current->next = link;

link->next = odd;

list1 = list1->next;

// Lets handle the last node

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

link->data = list1->data;

link->next = NULL;

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

current = even;

while (current->next != even) \{

current = current->next;

// Insert link at the end of the list

current->next = link;

link->next = even;

else \{

current = odd;

while (current->next != odd) \{

current = current->next;

// Insert link at the end of the list

current->next = link;

link->next = odd;

int main() \{

int i;

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

insert(i);

printf("Complete list: \\n");

display(list);

split\_list();

printf("\\nOdd : ");

display(odd);

printf("Even : ");

display(even);

return 0;

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

Complete list:

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

Odd : \[head\] => 1 => 3 => 5 => 7 => 9 => \[head\]

Even : \[head\] => 2 => 4 => 6 => 8 => 10 => \[head\]

¥ 我要打赏

纠错/补充

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

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

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

发表评论取消回复

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

相关阅读

相关循环链表C语言实现

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

相关 LeetCode:139.Word Break单词拆分(C语言)

相关 C语言重构【561】数组拆分 I

相关 C语言重构【343】整数拆分

相关 c语言实现文件拆分与合并,c++实现合并文件以及拆分实例代码

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

相关 C语言数组拆分

相关 C语言链表数据结构实验之链表五：单链表的拆分

相关链表的拆分