单链表的算法操作
2016-05-29 15:33
405 查看
1、单链表
在每个结点中除了包含数据域外,还包含了一个指针域,用以指向其后继结点。
2、头插法和尾插法建立链表
(1)算法代码
typedef struct SinglyLinkedLists
{
int data;
struct SinglyLinkedLists *next;
}SinglyLinkedLists;
void createListByFront(SinglyLinkedLists *&list, int a[], int n)//头插法
{
//newList指向新申请的结点
SinglyLinkedLists *newList;
int i;
//申请list的头结点
list = (SinglyLinkedLists *)malloc(sizeof(SinglyLinkedLists));
list->next = NULL;
for (i = 0; i < n; ++i)
{
newList = (SinglyLinkedLists *)malloc(sizeof(SinglyLinkedLists));
newList->data = a[i];
newList->next = list->next;
list->next = newList;
}
}
void createListByRear(SinglyLinkedLists *&list, int a[], int n)//尾插法
{
//newList指向新申请的结点,rearList始终指向list的终端结点
SinglyLinkedLists *newList, *rearList;
int i;
//申请list的头结点
list = (SinglyLinkedLists *)malloc(sizeof(SinglyLinkedLists));
list->next = NULL;
rearList = list;
for (i = 0; i < n; ++i)
{
newList = (SinglyLinkedLists *)malloc(sizeof(SinglyLinkedLists));
newList->data = a[i];
rearList->next = newList;
rearList = rearList->next;
}
rearList->next = NULL;
}
void queryData(SinglyLinkedLists *list)
{
SinglyLinkedLists *p = list->next;
while (p != NULL)
{
printf("%d\n", p->data);
p = p->next;
}
}
void main()
{
SinglyLinkedLists *list;
int a[] = { 1, 2, 3, 4, 5 };
int n = 5;
createListByFront(list, a, n);
queryData(list);
createListByRear(list, a, n);
queryData(list);
system("pause");
}(2)运行结果
5
4
3
2
1
1
2
3
4
5
请按任意键继续. . .3、单链表的结点插入操作
假设p指向一个结点,要将s所指结点插入p所指结点之后的操作如下:
(1)s->next=p->next;
(2)p->next=s;
4、单链表的结点删除操作
假设p指向一个结点,要删除p所指结点的后继结点的操作如下:
(1)q=p->next;
(2)p->next=p->next->next;
(3)free(q);//释放q所指结点的内存空间
在每个结点中除了包含数据域外,还包含了一个指针域,用以指向其后继结点。
2、头插法和尾插法建立链表
(1)算法代码
typedef struct SinglyLinkedLists
{
int data;
struct SinglyLinkedLists *next;
}SinglyLinkedLists;
void createListByFront(SinglyLinkedLists *&list, int a[], int n)//头插法
{
//newList指向新申请的结点
SinglyLinkedLists *newList;
int i;
//申请list的头结点
list = (SinglyLinkedLists *)malloc(sizeof(SinglyLinkedLists));
list->next = NULL;
for (i = 0; i < n; ++i)
{
newList = (SinglyLinkedLists *)malloc(sizeof(SinglyLinkedLists));
newList->data = a[i];
newList->next = list->next;
list->next = newList;
}
}
void createListByRear(SinglyLinkedLists *&list, int a[], int n)//尾插法
{
//newList指向新申请的结点,rearList始终指向list的终端结点
SinglyLinkedLists *newList, *rearList;
int i;
//申请list的头结点
list = (SinglyLinkedLists *)malloc(sizeof(SinglyLinkedLists));
list->next = NULL;
rearList = list;
for (i = 0; i < n; ++i)
{
newList = (SinglyLinkedLists *)malloc(sizeof(SinglyLinkedLists));
newList->data = a[i];
rearList->next = newList;
rearList = rearList->next;
}
rearList->next = NULL;
}
void queryData(SinglyLinkedLists *list)
{
SinglyLinkedLists *p = list->next;
while (p != NULL)
{
printf("%d\n", p->data);
p = p->next;
}
}
void main()
{
SinglyLinkedLists *list;
int a[] = { 1, 2, 3, 4, 5 };
int n = 5;
createListByFront(list, a, n);
queryData(list);
createListByRear(list, a, n);
queryData(list);
system("pause");
}(2)运行结果
5
4
3
2
1
1
2
3
4
5
请按任意键继续. . .3、单链表的结点插入操作
假设p指向一个结点,要将s所指结点插入p所指结点之后的操作如下:
(1)s->next=p->next;
(2)p->next=s;
4、单链表的结点删除操作
假设p指向一个结点,要删除p所指结点的后继结点的操作如下:
(1)q=p->next;
(2)p->next=p->next->next;
(3)free(q);//释放q所指结点的内存空间
相关文章推荐
- C#数据结构之顺序表(SeqList)实例详解
- Lua教程(七):数据结构详解
- 解析从源码分析常见的基于Array的数据结构动态扩容机制的详解
- C#数据结构之队列(Quene)实例详解
- C#数据结构揭秘一
- C#定义并实现单链表实例解析
- C#数据结构之单链表(LinkList)实例详解
- 数据结构之Treap详解
- C语言实现单链表逆序与逆序输出实例
- 用C语言举例讲解数据结构中的算法复杂度结与顺序表
- C#数据结构之堆栈(Stack)实例详解
- C语言单链表常见操作汇总
- C#数据结构之双向链表(DbLinkList)实例详解
- JavaScript数据结构和算法之图和图算法
- Java数据结构及算法实例:冒泡排序 Bubble Sort
- C数据结构之单链表详细示例分析
- Java数据结构及算法实例:插入排序 Insertion Sort
- Java数据结构及算法实例:考拉兹猜想 Collatz Conjecture
- java数据结构之java实现栈
- 【数据结构与算法】数组应用4:多项式计算Java版