链表 带表头 循环
来源:互联网 发布:linux编辑保存命令 编辑:程序博客网 时间:2024/06/10 22:14
/*****************************************************
copyright (C), 2014-2015, Lighting Studio. Co., Ltd.
File name:
Author:Jerey_Jobs Version:0.1 Date:
Description:
Funcion List:
*****************************************************/
#include <stdio.h>
#include <stdlib.h>
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node * Link;
void create_newnode(Link *new_node);
void create_link(Link * head)
{
create_newnode(head);
(*head)->next = *head;
}
void insert_node_head(Link * head,Link new_node)
{
new_node->next = (*head)->next;
(*head)->next = new_node;
}
void display_node(Link head)
{
Link tmp;
tmp = head->next;
if(tmp == head)
{
printf("the link is emply!\n");
}
while(tmp != head)
{
printf("num = %d\n",tmp->num);
tmp = tmp->next;
}
}
void is_malloc_ok(Link new_node)
{
if(new_node == NULL)
{
printf("malloc error!\n");
exit(-1);
}
}
void create_newnode(Link * new_node)
{
*new_node = (Link) malloc(sizeof(Node));
is_malloc_ok(*new_node);
}
void insert_node_tail(Link *head,Link new_node)
{
Link tmp;
tmp = (*head)->next;
while(tmp->next != *head)
{
tmp = tmp->next;
}
tmp->next = new_node;
new_node->next = *head;
}
void insert_node_mid(Link *head,Link new_node,int num)
{
Link tmp;
Link p;
tmp = (*head)->next;
if(NULL == (*head)->next)
{
new_node->next = NULL;
(*head)->next = new_node;
return;
}
else
{
while(tmp->num < num && tmp->next != NULL)
{
p =tmp;
tmp = tmp->next;
}
if(tmp->next != NULL)
{
new_node->next = tmp;
p->next = new_node;
}
else
{
if(tmp->num < num)
{
new_node->next = NULL;
tmp->next = new_node;
}
else
{
p->next = new_node;
new_node->next = tmp;
}
}
}
}
void delete_node(Link *head,int num)
{
Link tmp;
Link p;
tmp = p = *head;
if(NULL == *head)
{
printf("link is empty!\n");
return;
}
while(tmp->num != num && tmp->next != NULL)
{
p = tmp;
tmp = tmp->next;
}
if(tmp->num == num)
{
if(tmp == *head)
{
*head = tmp->next;
free(tmp);
}
else
{
p->next = tmp->next;
free(tmp);
}
}
else
{
printf("no such node!\n");
}
}
void release(Link *head)
{
Link tmp = NULL;
tmp = (*head)->next;
while(tmp != *head)
{
(*head)->next = tmp->next;
free(tmp);
tmp = (*head)->next;
}
}
void revers_link(Link *head)
{
Link p1;
Link p2;
Link p3;
p3 = *head;
if(*head == NULL)
{
printf("the link is empty!\n");
return;
}
if(p3->next == NULL)
{
printf("this link has only one element!\n");
return;
}
p2 = p3->next;
if(p2->next == NULL)
{
p3->next = NULL;
*head =p2;
return;
}
p1 = p2->next;
while(p1->next != NULL)
{
p2->next = p3;
p3 = p2;
p2 = p1;
p1 = p1->next;
}
p2->next = p3;
p1->next = p2;
(*head)->next = NULL;
*head = p1;
}
int main()
{
Link head = NULL;
Link new_node = NULL;
int i;
int num;
create_link(&head);
for(i = 0; i < 10;i++)
{
create_newnode(&new_node);
new_node->num = i;
// insert_node_head(&head,new_node);
insert_node_tail(&head,new_node);
}
// printf("please input a num!\n");
// scanf("%d",&num);
// create_newnode(&new_node);
// new_node->num = num;
// insert_node_mid(&head,new_node,num);
// delete_node(&head,num);
display_node(head);
// revers_link(&head);
release(&head);
display_node(head);
return 0;
}
copyright (C), 2014-2015, Lighting Studio. Co., Ltd.
File name:
Author:Jerey_Jobs Version:0.1 Date:
Description:
Funcion List:
*****************************************************/
#include <stdio.h>
#include <stdlib.h>
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node * Link;
void create_newnode(Link *new_node);
void create_link(Link * head)
{
create_newnode(head);
(*head)->next = *head;
}
void insert_node_head(Link * head,Link new_node)
{
new_node->next = (*head)->next;
(*head)->next = new_node;
}
void display_node(Link head)
{
Link tmp;
tmp = head->next;
if(tmp == head)
{
printf("the link is emply!\n");
}
while(tmp != head)
{
printf("num = %d\n",tmp->num);
tmp = tmp->next;
}
}
void is_malloc_ok(Link new_node)
{
if(new_node == NULL)
{
printf("malloc error!\n");
exit(-1);
}
}
void create_newnode(Link * new_node)
{
*new_node = (Link) malloc(sizeof(Node));
is_malloc_ok(*new_node);
}
void insert_node_tail(Link *head,Link new_node)
{
Link tmp;
tmp = (*head)->next;
while(tmp->next != *head)
{
tmp = tmp->next;
}
tmp->next = new_node;
new_node->next = *head;
}
void insert_node_mid(Link *head,Link new_node,int num)
{
Link tmp;
Link p;
tmp = (*head)->next;
if(NULL == (*head)->next)
{
new_node->next = NULL;
(*head)->next = new_node;
return;
}
else
{
while(tmp->num < num && tmp->next != NULL)
{
p =tmp;
tmp = tmp->next;
}
if(tmp->next != NULL)
{
new_node->next = tmp;
p->next = new_node;
}
else
{
if(tmp->num < num)
{
new_node->next = NULL;
tmp->next = new_node;
}
else
{
p->next = new_node;
new_node->next = tmp;
}
}
}
}
void delete_node(Link *head,int num)
{
Link tmp;
Link p;
tmp = p = *head;
if(NULL == *head)
{
printf("link is empty!\n");
return;
}
while(tmp->num != num && tmp->next != NULL)
{
p = tmp;
tmp = tmp->next;
}
if(tmp->num == num)
{
if(tmp == *head)
{
*head = tmp->next;
free(tmp);
}
else
{
p->next = tmp->next;
free(tmp);
}
}
else
{
printf("no such node!\n");
}
}
void release(Link *head)
{
Link tmp = NULL;
tmp = (*head)->next;
while(tmp != *head)
{
(*head)->next = tmp->next;
free(tmp);
tmp = (*head)->next;
}
}
void revers_link(Link *head)
{
Link p1;
Link p2;
Link p3;
p3 = *head;
if(*head == NULL)
{
printf("the link is empty!\n");
return;
}
if(p3->next == NULL)
{
printf("this link has only one element!\n");
return;
}
p2 = p3->next;
if(p2->next == NULL)
{
p3->next = NULL;
*head =p2;
return;
}
p1 = p2->next;
while(p1->next != NULL)
{
p2->next = p3;
p3 = p2;
p2 = p1;
p1 = p1->next;
}
p2->next = p3;
p1->next = p2;
(*head)->next = NULL;
*head = p1;
}
int main()
{
Link head = NULL;
Link new_node = NULL;
int i;
int num;
create_link(&head);
for(i = 0; i < 10;i++)
{
create_newnode(&new_node);
new_node->num = i;
// insert_node_head(&head,new_node);
insert_node_tail(&head,new_node);
}
// printf("please input a num!\n");
// scanf("%d",&num);
// create_newnode(&new_node);
// new_node->num = num;
// insert_node_mid(&head,new_node,num);
// delete_node(&head,num);
display_node(head);
// revers_link(&head);
release(&head);
display_node(head);
return 0;
}
0 0
- 链表 带表头 循环
- 链表 带表头 循环
- 带表头的循环链表
- 带表头的循环单项链表
- 带表头的单向循环链表
- 链表(单链表,带表头的链表,单向循环链表,双向循环链表)
- 不带表头的单向链表,带表头的单向链表,带表头的单向循环链表,带表头的双向循环链表。
- 不带表头结点的非循环单向链表
- 带表头节点的单向循环链表编程
- 带表头节点的双向循环链表编程
- 带表头结点的双向循环链表
- 带表头节点的循环单向链表
- 带表头结点的双向循环链表
- 带表头结点的双向循环链表
- 不带表头节点的循环单向链表
- 带表头结点的双向循环链表
- 【链表】单链表——带表头结点
- 判断带表头的单向循环链表La是否递增
- Lightoj 1082【RMQ】
- 区块链开源项目Ripple二、相关概念介绍及思考
- Oracle建立表空间和用户
- 极光推送JPush java服务端代码
- Linux虚拟机mysql连接数太多
- 链表 带表头 循环
- cat命令
- POJ3903(dp最长上升子序列STL)
- Glide使用详解
- jquery的样式操作,类操作(添加 删除 css)
- 数据结构实验之排序七:选课名单(卡内存的一道题。。坑)
- Codeforces 368C Sereja and Algorithm【思维】
- 接口
- 修改mysql数据库密码