无头结点单向不循环链表
创建空链表
typedef struct node
{
int num;
struct node *next;
}Node;
typedef Node * Link;
void create_link(Link *head)
{
*head = NULL;
}//创建一个空链表
创建结点
int is_malloc_ok(Link new_node)
{
if(NULL == new_node)
{
printf("malloc error!\n");
return MALLOC_NO;
}
return MALLOC_OK;
}//定义一个函数,判断节点内存分配成不成功
int create_node(Link *new_node)
{
*new_node = (Link) malloc(sizeof(Node));
if(MALLOC_OK == is_malloc_ok(*new_node))
{
return CREATE_OK;
}
return CREATE_NO;
}//创建节点
头插法插入数据
void insert_node_head(Link *head,Link new_node)
{
new_node->next = *head;
*head = new_node;
}//头插
尾插法插入数据
void insert_node_tail(Link *head,Link new_node)
{
Link p = NULL;
p = *head;
if(NULL == *head)
{
*head = new_node;
new_node->next = NULL;
}
else
{
while(p->next != NULL)
{
p = p->next;
}
p->next = new_node;
new_node->next = NULL;
}
}//尾插
中间前插
void insert_node_mid_before(Link *head,Link new_node,int loc)
{
Link p = NULL;
Link q = NULL;
p = q = *head;
while(p != NULL && p->num != loc)//条件顺序不能颠倒,当p=NULL时,p->num没有值,出现段错误
{
q = p;
p = p->next;
}//p,q始终相邻
if(p == *head)
{
new_node->next = *head;
*head = new_node;
}//在头结点前面插入数据,会改变头指针指向,需要单独考虑
else
{
q->next = new_node;
new_node->next = p;
}
}
中间后插
void insert_node_mid_after(Link *head,Link new_node,int loc)
{
Link p = NULL;
p = *head;
while(p != NULL && p->num != loc)
{
p = p->next;
}
new_node->next = p->next;
p->next =new_node;
}//中后插
遍历链表
void display_link(Link head) //一级指针
{
Link p = NULL;
p = head;
if(NULL == head)
{
printf("The link is empty!\n");
return;
}
while(p != NULL)
{
printf("%d ",p->num);
p = p->next;
}
}//遍历链表
释放链表
void release_link(Link *head)
{
Link p = NULL;
p = *head;
while(*head != NULL)
{
*head = (*head)->next;
free(p);
p = *head;
}
printf("Link is empty!\n");
}//释放链表
整体代码
#include <stdio.h>
#include <stdlib.h>
#define MALLOC_OK 1
#define MALLOC_NO 0
#define CREATE_OK 1
#define CREATE_NO 0
typedef struct node
{
int num;
struct node *next;
}Node;
typedef Node * Link;
void create_link(Link *head)
{
*head = NULL;
}//创建一个空链表
int is_malloc_ok(Link new_node)
{
if(NULL == new_node)
{
printf("malloc error!\n");
return MALLOC_NO;
}
return MALLOC_OK;
}
int create_node(Link *new_node)
{
*new_node = (Link) malloc(sizeof(Node));
if(MALLOC_OK == is_malloc_ok(*new_node))
{
return CREATE_OK;
}
return CREATE_NO;
}//创建节点
void insert_node_head(Link *head,Link new_node)
{
new_node->next = *head;
*head = new_node;
}//头插
void display_link(Link head)
{
Link p = NULL;
p = head;
if(NULL == head)
{
printf("The link is empty!\n");
return;
}
while(p != NULL)
{
printf("%d ",p->num);
p = p->next;
}
}//遍历链表
void insert_node_tail(Link *head,Link new_node)
{
Link p = NULL;
p = *head;
if(NULL == *head)
{
*head = new_node;
new_node->next = NULL;
}
else
{
while(p->next != NULL)
{
p = p->next;
}
p->next = new_node;
new_node->next = NULL;
}
}//尾插
void release_link(Link *head)
{
Link p = NULL;
p = *head;
while(*head != NULL)
{
*head = (*head)->next;
free(p);
p = *head;
}
printf("Link is empty!\n");
}//释放链表
void insert_node_mid_before(Link *head,Link new_node,int loc)
{
Link p = NULL;
Link q = NULL;
p = q = *head;
while(p != NULL && p->num != loc)//条件顺序不能颠倒,当p=NULL时,p->num没有值,出现段错误
{
q = p;
p = p->next;
}//p,q始终相邻
if(p == *head)
{
new_node->next = *head;
*head = new_node;
}//在头结点前面插入数据,会改变头指针指向,需要单独考虑
else
{
q->next = new_node;
new_node->next = p;
}
}
void insert_node_mid_after(Link *head,Link new_node,int loc)
{
Link p = NULL;
p = *head;
while(p != NULL && p->num != loc)
{
p = p->next;
}
new_node->next = p->next;
p->next =new_node;
}//中后插
int main(int argc, const char *argv[])
{
Link head = NULL;
Link new_node = NULL;
create_link(&head);
int i;
int loc;
srand((unsigned)time(NULL));//生成随机数
for(i = 0; i < 10; i++)
{
if(CREATE_OK == create_node(&new_node))
{
new_node->num = i + 1;
//insert_node_head(&head,new_node);
insert_node_tail(&head,new_node);
}
}
display_link(head);
putchar(10);
printf("input location:");
scanf("%d",&loc);
if(CREATE_OK == create_node(&new_node))
{
printf("please input num:");
scanf("%d",&new_node->num);
// insert_node_mid_before(&head,new_node,loc);
insert_node_mid_after(&head,new_node,loc);
}
putchar(10);
display_link(head);
putchar(10);
release_link(&head);
display_link(head);
printf("\n");
return 0;
}
直接插入排序
void insert_node_sort(Link *head,Link new_node)
{
Link p = NULL;
Link q = NULL;
p = q = *head;
while(p != NULL && p->num > new_node->num)
{
q = p;
p = p->next;
}
if(p == *head)
{
new_node->next = *head;
*head = new_node;
}
else
{
q->next = new_node;
new_node->next = p;
}
}
删除数据
void delete_node(Link *head,int num)
{
Link p , q = NULL;
p = q =*head;
if(*head == NULL)
{
printf("The link is empty!\n");
}
else
{
while(p != NULL && p->num != num)
{
q = p;
p = p->next;
}
if(NULL == p)
{
printf("no such node\n");
}
else if(p == *head)
{
*head = (*head)->next;
free(p);
}
else
{
q->next = p->next;
free(p);
}
}
}
链表倒置
void reverse_link(Link *head)
{
Link p1,p2,p3;
p1 = *head;
p2 = NULL;
p3 = NULL;
if(NULL == *head)
{
printf("error");
}
while(p1 != NULL)
{
p3 = p1->next;
p1->next = p2;
p2 = p1;
p1 = p3;
}
*head = p2;
}
整体代码
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define MALLOC_OK 1
#define MALLOC_NO 0
#define CREATE_OK 1
#define CREATE_NO 0
typedef struct node
{
int num;
struct node *next;
}Node;
typedef Node * Link;
void create_link(Link *head)
{
*head = NULL;
}//创建一个空链表
int is_malloc_ok(Link new_node)
{
if(NULL == new_node)
{
printf("malloc error!\n");
return MALLOC_NO;
}
return MALLOC_OK;
}
int create_node(Link *new_node)
{
*new_node = (Link) malloc(sizeof(Node));
if(MALLOC_OK == is_malloc_ok(*new_node))
{
return CREATE_OK;
}
return CREATE_NO;
}//创建节点
void display_link(Link head)
{
Link p = NULL;
p = head;
if(NULL == head)
{
printf("The link is empty!\n");
return;
}
while(p != NULL)
{
printf("%d ",p->num);
p = p->next;
}
}//遍历链表
void release_link(Link *head)
{
Link p = NULL;
p = *head;
while(*head != NULL)
{
*head = (*head)->next;
free(p);
p = *head;
}
printf("Link is empty!\n");
}//释放链表
void insert_node_sort(Link *head,Link new_node)
{
Link p = NULL;
Link q = NULL;
p = q = *head;
while(p != NULL && p->num > new_node->num)
{
q = p;
p = p->next;
}
if(p == *head)
{
new_node->next = *head;
*head = new_node;
}
else
{
q->next = new_node;
new_node->next = p;
}
}
void delete_node(Link *head,int num)
{
Link p , q = NULL;
p = q =*head;
if(*head == NULL)
{
printf("The link is empty!\n");
}
else
{
while(p != NULL && p->num != num)
{
q = p;
p = p->next;
}
if(NULL == p)
{
printf("no such node\n");
}
else if(p == *head)
{
*head = (*head)->next;
free(p);
}
else
{
q->next = p->next;
free(p);
}
}
}
void reverse_link(Link *head)
{
Link p1,p2,p3;
p1 = *head;
p2 = NULL;
p3 = NULL;
if(NULL == *head)
{
printf("error");
}
while(p1 != NULL)
{
p3 = p1->next;
p1->next = p2;
p2 = p1;
p1 = p3;
}
*head = p2;
}
int main(int argc, const char *argv[])
{
Link head = NULL;
Link new_node = NULL;
create_link(&head);
int i;
int loc;
int num;
srand((unsigned)time(NULL));//生成随机数
for(i = 0; i < 10; i++)
{
if(CREATE_OK == create_node(&new_node))
{
new_node->num = rand() % 100;
insert_node_sort(&head,new_node);
}
}
display_link(head);
putchar(10);
// printf("please input delete num:");
// scanf("%d",&num);
// delete_node(&head,num);
reverse_link(&head);
display_link(head);
putchar(10);
//Link p = find_node(&head,num);
//printf("%p",p);
release_link(&head);
display_link(head);
printf("\n");
return 0;
}
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define MALLOC_NO 0
#define MALLOC_OK 1
#define CREATE_NODE_NO 0
#define CREATE_NODE_OK 1
typedef struct node
{
int num;
struct node *next;
}Node;
typedef Node * Link;
void create_link(Link *head)
{
*head = NULL;
}
int is_malloc_ok(Link new_node)
{
if(NULL == new_node)
{
printf("malloc fail!\n");
return MALLOC_NO;
}
else
{
return MALLOC_OK;
}
}
int create_node(Link *new_node)
{
*new_node = (Link) malloc(sizeof(Node));
if(MALLOC_OK == is_malloc_ok(*new_node))
{
return CREATE_NODE_OK;
}
else
{
return CREATE_NODE_NO;
}
}
void insert_node_head(Link *head,Link new_node)
{
new_node->next = *head;
*head = new_node;
}
void insert_node_tail(Link *head,Link new_node)
{
Link p =NULL;
p = *head;
if(NULL == *head)
{
*head = new_node;
new_node->next = NULL;
}
else
{
while(p->next != NULL)
{
p =p->next;
}
p->next = new_node;
new_node->next = NULL;
}
}
void display_link(Link head)
{
Link p = NULL;
p = head;
if(NULL == head)
{
printf("This link is empty!\n");
}
else
{
while(p != NULL)
{
printf("%d ",p->num);
p= p->next;
}
}
}
void insert_node_mid_after(Link *head,Link new_node,int loc)
{
Link p = NULL;
p = *head;
while(p != NULL && p->num != loc)
{
p = p->next;
}
new_node->next = p->next;
p->next = new_node;
}
void insert_node_mid_before(Link *head,Link new_node,int loc)
{
Link p,q = NULL;
p = q = *head;
while(p != NULL && p->num != loc)
{
q = p;
p = p->next;
}
if(p == *head)
{
new_node->next = *head;
*head = new_node;
}
else
{
q->next = new_node;
new_node->next = p;
}
}
void find_link(Link *head,int num)
{
Link p = NULL;
p = *head;
while(p != NULL && p->num != num)
{
p = p->next;
}
printf("%d",p->num);
}
void release_link(Link *head)
{
Link p = NULL;
p = *head;
while(*head != NULL)
{
*head = (*head)->next;
free(p);
p = *head;
}
printf("release link success!");
}
void insert_node_sort(Link *head,Link new_node)
{
Link p,q = NULL;
p = q = *head;
while(p != NULL && p->num < new_node->num)
{
q = p;
p = p->next;
}
if(p == *head)
{
new_node->next = *head;
*head = new_node;
}
else
{
q->next = new_node;
new_node->next = p;
}
}
void delete_node(Link *head,int num)
{
Link p,q = NULL;
p = q = *head;
if(*head == NULL)
{
printf("The link is empty!\n");
}
else
{
while(p != NULL && p->num != num)
{
q = p;
p = p->next;
}
if(NULL == p)
{
printf("no such node\n");
}
else if(p == *head)
{
*head = (*head)->next;
free(p);
}
else
{
q->next = p->next;
free(p);
}
}
}
int main(int argc, const char *argv[])
{
Link head = NULL;
Link new_node = NULL;
int i;
int loc;
int num;
int num2;
srand((unsigned)time(NULL));
create_link(&head);
for(i = 0; i < 10; i++)
{
if(CREATE_NODE_OK == create_node(&new_node))
{
new_node->num = rand() % 100;
insert_node_sort(&head,new_node);
//new_node->num = i + 1;
// insert_node_tail(&head,new_node);
// insert_node_head(&head,new_node);
}
}
display_link(head);
printf("\n");
printf("input you find num:");
scanf("%d",&num);
find_link(&head,num);
printf("\n");
printf("input you want to delete num:");
scanf("%d",&num2);
delete_node(&head,num2);
display_link(head);
printf("\n");
/*
printf("input loc:");
scanf("%d",&loc);
if(CREATE_NODE_OK == create_node(&new_node))
{
printf("please input num:");
scanf("%d",&new_node->num);
//insert_node_mid_after(&head,new_node,loc);
insert_node_mid_before(&head,new_node,loc);
}
display_link(head);
printf("\n");
*/
release_link(&head);
printf("\n");
return 0;
}