双向循环链表
2015-07-18 23:09
323 查看
/*****************************************************************************************************************************
Description :双向循环链表
Author :feng
Date :2015·07·18
*****************************************************************************************************************************/
#include <stdio.h>
#include <string.h>
#include <malloc.h>
#define SUCCESS 0
#define UNSUCCESS -1
struct student
{
char name[10];
int age;
struct student * prior;
struct student *next;
};
typedef struct student STU;
typedef struct student * Link;
void create(Link *head)
{
*head = (Link)malloc(sizeof(STU));
(*head)->next = *head;
(*head)->prior = *head;
}
int tail_insert(Link * head,Link *node)
{
Link temp = (*head)->next;
while(temp->next != *head)
temp = temp->next;
temp->next = *node;
(*node)->next = *head;
(*node)->prior = temp;
(*head)->prior = *node;
}
void mid_insert(Link *head,Link * node,char * str)
{
Link temp = (*head)->next;
while(temp->next != *head)
{
if(strcmp(temp->name,str) == 0)
{
(*node)->next = temp->next;
(*node)->prior = temp;
temp->next->prior = *node;
temp->next = *node;
}
temp = temp->next;
}
}
int main()
{
Link head;
create(&head);
Link newnode = NULL;
int i = 0;
for(i = 0; i < 3;i ++)
{
newnode = (Link)malloc(sizeof(STU));
tail_insert(&head,&newnode);
printf("please enter the name of No.%d: ",i + 1);
scanf("%s",newnode->name);
printf("please enter the age of No.%d: ",i + 1);
scanf("%d",&newnode->age);
}
char name[10];
newnode = (Link)malloc(sizeof(STU));
printf("after : ");
scanf("%s",name);
mid_insert(&head,&newnode,name);
printf("please enter the name ");
scanf("%s",newnode->name);
printf("please enter the age ");
scanf("%d",&newnode->age);
Link temp = head->next;
while(temp != head)
{
printf("name : %s
age : %d\n",temp->name,temp->age);
temp = temp->next;
}
return SUCCESS;
}
Description :双向循环链表
Author :feng
Date :2015·07·18
*****************************************************************************************************************************/
#include <stdio.h>
#include <string.h>
#include <malloc.h>
#define SUCCESS 0
#define UNSUCCESS -1
struct student
{
char name[10];
int age;
struct student * prior;
struct student *next;
};
typedef struct student STU;
typedef struct student * Link;
void create(Link *head)
{
*head = (Link)malloc(sizeof(STU));
(*head)->next = *head;
(*head)->prior = *head;
}
int tail_insert(Link * head,Link *node)
{
Link temp = (*head)->next;
while(temp->next != *head)
temp = temp->next;
temp->next = *node;
(*node)->next = *head;
(*node)->prior = temp;
(*head)->prior = *node;
}
void mid_insert(Link *head,Link * node,char * str)
{
Link temp = (*head)->next;
while(temp->next != *head)
{
if(strcmp(temp->name,str) == 0)
{
(*node)->next = temp->next;
(*node)->prior = temp;
temp->next->prior = *node;
temp->next = *node;
}
temp = temp->next;
}
}
int main()
{
Link head;
create(&head);
Link newnode = NULL;
int i = 0;
for(i = 0; i < 3;i ++)
{
newnode = (Link)malloc(sizeof(STU));
tail_insert(&head,&newnode);
printf("please enter the name of No.%d: ",i + 1);
scanf("%s",newnode->name);
printf("please enter the age of No.%d: ",i + 1);
scanf("%d",&newnode->age);
}
char name[10];
newnode = (Link)malloc(sizeof(STU));
printf("after : ");
scanf("%s",name);
mid_insert(&head,&newnode,name);
printf("please enter the name ");
scanf("%s",newnode->name);
printf("please enter the age ");
scanf("%d",&newnode->age);
Link temp = head->next;
while(temp != head)
{
printf("name : %s
age : %d\n",temp->name,temp->age);
temp = temp->next;
}
return SUCCESS;
}
相关文章推荐
- c++虚函数表解析
- GCD多线程的使用(二)
- 深入分析Cocos2d-x 2.0中的“纹理”
- Markdown 的一个例子
- #24 Swap Nodes in Pairs
- iOS bug处理
- JS Call()与Apply()
- java对字符的编码处理
- SpringMVC入门配置web.config及applicationContent-mvc.xml
- 转:线程池原理及创建(C++实现)
- word中的图片如何导入博客?
- KVM虚拟化平台部署及管理
- LeetCode 231 Power of Two
- Markdown语法简介
- TabHost主界面实现
- UIKit框架结构
- C#获取当前函数名称
- 煎饼侠观后感
- Java IO
- WebSocket 实战