
- 按例子按时间学习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 *prev; struct node *next; }; struct node *head = NULL; struct node *last = NULL; struct node *current = NULL; //display the list void printList() { struct node *ptr = head; printf("\n[head] <=>"); //start from the beginning while(ptr != NULL) { printf(" %d <=>",ptr->data); ptr = ptr->next; } printf(" [last]\n"); } //display the list void print_backward() { struct node *ptr = last; printf("\n[head] <=>"); //start from the beginning while(ptr != NULL) { printf(" %d <=>",ptr->data); ptr = ptr->prev; } printf(" [last]\n"); } //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(head==NULL) { head = link; return; } current = head; // 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; last = link; link->prev = current; } int main() { insert(10); insert(20); insert(30); insert(1); insert(40); insert(56); printList(); print_backward(); return 0; }
输出
程序输出应为 −
[head] <=> 10 <=> 20 <=> 30 <=> 1 <=> 40 <=> 56 <=> [last] [head] <=> 56 <=> 40 <=> 1 <=> 30 <=> 20 <=> 10 <=> [last]
linked_list_programs_in_c.htm
广告