- 按示例学习C语言的时间
- 按示例学习C语言 - 首页
- C语言示例 - 简单的程序
- C语言示例 - 循环/迭代
- C语言示例 - 模式
- C语言示例 - 数组
- C语言示例 - 字符串
- C语言示例 - 数学
- C语言示例 - 链表
- C语言编程实用资源
- 按示例学习C语言 - 指南速查
- 按示例学习C语言 - 资源
- 按示例学习C语言 - 讨论
C语言环形链表合并
实现
此算法的实现如下 -
#include <stdio.h> #include <stdlib.h> 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(data%2 == 0) { if(even == NULL) { even = link; even->next = link; return; } else { current = even; while(current->next != even) current = current->next; // Insert link at the end of the list current->next = link; link->next = even; } } else { if(odd == NULL) { odd = link; odd->next = link; return; } else { current = odd; while(current->next != odd) { current = current->next; } // Insert link at the end of the list current->next = link; link->next = odd; } } } void display(struct node *head) { int temp; struct node *ptr = head; if(head == NULL) { printf("Linked List not initialized"); return; } else if(head->next == head) { printf("%d", head->data); return; } printf("[head] =>"); while(ptr->next != head) { printf(" %d =>",ptr->data); ptr = ptr->next; } printf(" %d =>",ptr->data); printf(" [head]\n"); } void combine() { struct node *elink, *olink; list = even; elink = list; while(elink->next!= even) { elink = elink->next; } elink->next = odd; olink = odd; while(olink->next!= odd) { olink = olink->next; } olink->next = even; } int main() { int i; for(i = 1; i <= 10; i++) insert(i); printf("Even : "); display(even); printf("Odd : "); display(odd); combine(); printf("Combined List :\n"); display(list); return 0; }
输出
程序输出如下 -
Even : [head] => 2 => 4 => 6 => 8 => 10 => [head] Odd : [head] => 1 => 3 => 5 => 7 => 9 => [head] Combined List : [head] => 2 => 4 => 6 => 8 => 10 => 1 => 3 => 5 => 7 => 9 => [head]
linked_list_programs_in_c.htm
广告