定义和概念
线性表
指定义指定n个元素的有限序列,具有以下特性:
1)除第一个元素以外,有且仅有一个直接前驱;
2)除最后一个元素以外有且仅有一个直接后继;
顺序表
元素相继存放在一个连续的序列里,具有线性表的特征,可以用一个与之对应的一维数组来描述他,可以进行顺序访问,或者随机访问。
链表
从分类来说,链表可以分为单链表,静态链表,循环链表,双向链表。对于每一个链表来说,他们都有一个与之对应的头指针。
结构
链表一定要用到结构体,一个链表的节点,通常有两个组成部分,一个值域,一个指针域,值域存放用户数值,指针域存放指针,指针可以指向下一个链表。
创建一个链表
1)建立一个结构体变量;
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node * Link;
2)主函数内建立相关变量,建立执行关系和逻辑顺序,我们要执行创建一个链表,分别从头,或者从尾部插入链表的下一个节点,然后是从中间指定位置插入节点,最后删除指定节点;
int main()
{
Link head = NULL;
Link new_node = NULL;
int i;
int num_loc;
int num_val;
printf("plz input the num location:\n");//指定节点位置
scanf("%d", &num_loc);
printf("plz input the num value:\n");//指定插入节点的值
scanf("%d", &num_val);
creat_link(&head);//创建链表
for(i = 0 ; i < 9 ; i++)
{
creat_node(&new_node , i);//创建节点
insert_node_head(&head , new_node);//从头插入新的节点
}
display(head);//显示
/* for(i = 0 ; i < 9 ;i++)
{
creat_node(&new_node , i);
insert_node_tail(&head , new_node);//从末尾插入新的节点
}
display(head);*/
print_star();
creat_node(&new_node , num_val);
insert_node_mid_front(&head , new_node , num_loc);//从中间插入节点,前方。
display(head);
/* print_star();
creat_node(&new_node , num_val);
insert_node_mid_behind(&head , new_node , num_loc);
display(head);*/
printf("plz input a num to delate :\n");
scanf("%d",&num_val);
node_del(&head , num_val);//删除指定节点
display(head);
return 0;
}
3)显示函数;
void display(Link head)
{
Link p;
p = head;
while(p != NULL)
{
printf("num = %d\n",p -> num);
p = p -> next;
}
}
4)创建链表;
void creat_link(Link *head)
{
*head = NULL;
}
5)创建节点;
void creat_node(Link *new_node ,int i)
{
*new_node = (Link) malloc (sizeof(Node));//分配空间给节点
is_malloc_ok(*new_node);//检查空间是否分配成功
(* new_node) -> num = i;
}
6)空间分配检查是否成功
void is_malloc_ok(Link new_node)
{
if(new_node == NULL)
{
printf("malloc error ! \n");
exit(-1);
}
}
7)从头部插入新节点;
void insert_node_head(Link *head, Link new_node)
{
new_node -> next = *head;
*head = new_node;
}
8)从尾部插入新节点;
void insert_node_tail(Link *head , Link new_node)
{
Link p;
p = *head;
if(p == NULL)//检查是否为空链表
{
*head = new_node;
new_node ->next = NULL;//进行创建操作
return;
}
while(p -> next != NULL)//检查知否为最后一个节点
{
p = p -> next;
}
p -> next = new_node;
new_node -> next = NULL;
}
9)从中间插入节点
void insert_node_mid_front(Link *head , Link new_node , int num_loc)
{
Link p;
Link q;
p = q = *head;
if (p == NULL)//检查空链表
{
*head = new_node;
new_node -> next = NULL;
}
else
{
while((p -> num != num_loc) && (p -> next != NULL))//遍历整个链表,查找合适的目标
{
q = p;
p = p -> next;
}
if(p == *head)//头部
{
new_node -> next = *head;
*head = new_node;
}
else if((p -> next == NULL) && (p -> num != num_loc))//尾部
{
p -> next = new_node;
new_node -> next = NULL;
}
else //中间
{
q -> next = new_node;
new_node -> next = p;
}
}
}
10)删除链表节点;
void node_del(Link *head,int num_val)
{
Link q;
Link p;
p = q = *head;
if(p == NULL)
{
printf("empty links \n");
}
else
{
while(p -> num != num_val && p -> next != NULL)
{
q = p ;
p = p -> next;
}
if((*head) -> num == num_val)
{
*head = (*head) -> next;
free(p);
}
else if(p -> next == NULL && p -> num != num_val)
{
printf("not found \n");
}
else
{
q -> next = p -> next;
free(p);
}
}
文末加上总的代码
/*****************************************************
copyright (C), 2014-2015, Lighting Studio. Co., Ltd.
File name锛?Author锛欽erey_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 is_malloc_ok(Link new_node)
{
if(new_node == NULL)
{
printf("malloc error ! \n");
exit(-1);
}
}
void creat_link(Link *head)
{
*head = NULL;
}
void creat_node(Link *new_node ,int i)
{
*new_node = (Link) malloc (sizeof(Node));
is_malloc_ok(*new_node);
(* new_node) -> num = i;
}
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;
p = *head;
if(p == NULL)
{
*head = new_node;
new_node ->next = NULL;
return;
}
while(p -> next != NULL)
{
p = p -> next;
}
p -> next = new_node;
new_node -> next = NULL;
}
void insert_node_mid_front(Link *head , Link new_node , int num_loc)
{
Link p;
Link q;
p = q = *head;
if (p == NULL)
{
*head = new_node;
new_node -> next = NULL;
}
else
{
while((p -> num != num_loc) && (p -> next != NULL))
{
q = p;
p = p -> next;
}
if(p == *head)
{
new_node -> next = *head;
*head = new_node;
}
else if((p -> next == NULL) && (p -> num != num_loc))
{
p -> next = new_node;
new_node -> next = NULL;
}
else
{
q -> next = new_node;
new_node -> next = p;
}
}
}
/*void insert_node_mid_behind(Link *head ,Link new_node ,int num_loc)
{
Link p;
if(p == NULL)
{
*head = new_node;
new_node -> next = NULL;
}
else
{
while((p -> num != num_loc) && (p -> next != NULL))
{
p = p -> next;
}
else if((p -> next == NULL) && (p -> num != num_loc))
{
p -> next = new_node;
new_node = NULL;
}
else
{
q -> next = new_node;
new_node ->next = p:
}
}
}*/
void node_del(Link *head,int num_val)
{
Link q;
Link p;
p = q = *head;
if(p == NULL)
{
printf("empty links \n");
}
else
{
while(p -> num != num_val && p -> next != NULL)
{
q = p ;
p = p -> next;
}
if((*head) -> num == num_val)
{
*head = (*head) -> next;
free(p);
}
else if(p -> next == NULL && p -> num != num_val)
{
printf("not found \n");
}
else
{
q -> next = p -> next;
free(p);
}
}
}
void display(Link head)
{
Link p;
p = head;
while(p != NULL)
{
printf("num = %d\n",p -> num);
p = p -> next;
}
}
void print_star()
{
printf("|*****************************|");
printf("\n");
}
int main()
{
Link head = NULL;
Link new_node = NULL;
int i;
int num_loc;
int num_val;
printf("plz input the num location:\n");
scanf("%d", &num_loc);
printf("plz input the num value:\n");
scanf("%d", &num_val);
creat_link(&head);
for(i = 0 ; i < 9 ; i++)
{
creat_node(&new_node , i);
insert_node_head(&head , new_node);
}
display(head);
/* for(i = 0 ; i < 9 ;i++)
{
creat_node(&new_node , i);
insert_node_tail(&head , new_node);
}
display(head);*/
print_star();
creat_node(&new_node , num_val);
insert_node_mid_front(&head , new_node , num_loc);
display(head);
/* print_star();
creat_node(&new_node , num_val);
insert_node_mid_behind(&head , new_node , num_loc);
display(head);*/
printf("plz input a num to delate :\n");
scanf("%d",&num_val);
node_del(&head , num_val);
display(head);
return 0;
}