学英语就选新概念英语:https://item.taobao.com/item.htm?spm=686.1000925.0.0.znXWxu&id=534934477732
一、判断链表是否为空
就是判断头结点的pNext是否指向空节点。
<span style="font-size:24px;">//start
bool is_empty(PNODE pHead)
{
if (pHead->pNext == NULL)
{
return true;
}
else
{
return false;
}
}
//end</span>
二、求链表长度
<span style="font-size:24px;">//start
int length_list(PNODE pHead)
{
PNODE p = pHead->pNext;
int len = 0;
while (p != NULL)
{
++len;
p = p->pNext;
}
return len;
}
//end</span>
三、链表排序
第一层循环用来定位当前比较的位置;
第二层循环表示当前第一层循环的位置之后的剩余位置每次与当前第一层循环的位置进行比较;
结果:是把链表当中的定位位置之后的最小值放到当前位置。
<span style="font-size:24px;">//start
void sort_list(PNODE pHead)
{
int i, j, t;
PNODE p, q;
int len = length_list(pHead);
for (i = 0, p = pHead->pNext; i < len -1; ++i, p = p->pNext)
{
for (j = i + 1, q = p->pNext; j < len; ++j, q = q->pNext)
{
if (p->data > q->data)
{
t = p->data;
p->data = q->data;
q->data = t;
}
}
}
return;
}
//end</span>
四、插入一个新节点
1. 在while循环里面把p节点的位置定位在要插入新节点位置的前一个位置(p = p->pNext);
2. 创建新节点pNew用来存储val的值;
3. q = p->pNext:记录要插入新节点位置之前的节点;
4. p->pNext = pNew:插入新的节点;
5. pNew->pNext = q:把旧节点链接到新节点之后;
<span style="font-size:24px;">//start
bool insert_list(PNODE pHead, int pos, int val)
{
int i = 0;
PNODE p = pHead;
PNODE pNew = NULL;
PNODE q = NULL;
while (p != NULL && i < pos -1)
{
p = p->pNext;
++i;
}
if (i > pos -1 || NULL == p)
{
return false;
}
pNew = (PNODE)malloc(sizeof(NODE));
if (pNew == NULL)
{
printf("Dynamic memory allocation failure");
exit(-1);
}
pNew->data = val;
q = p->pNext;
p->pNext = pNew;
pNew->pNext = q;
return true;
}
//end</span>
五、删除一个节点
1. 在while循环里面把p节点的位置定位在要删除节点位置的前一个位置(p = p->pNext);
2. q = p->pNext:找到要删除的节点;
3. p->pNext = p->pNext->pNext:删除q节点;
4. free(q)释放应该删除的节点;
5. q = NULL;
<span style="font-size:24px;">//start
bool delete_list(PNODE pHead, int pos, int *pVal)
{
int i = 0;
PNODE p = pHead;
PNODE pNew = NULL;
PNODE q = NULL;
while (p->pNext != NULL && i < pos -1)
{
p = p->pNext;
++i;
}
if (i > pos -1 || p->pNext == NULL)
{
return false;
}
q = p->pNext;
*pVal = q->data;
p->pNext = p->pNext->pNext;
free(q);
q = NULL;
return true;
}
//end</span>
源代码如下:
<span style="font-size:24px;">#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
#include <stdbool.h>
typedef struct Node
{
int data;
struct Node *pNext;
}NODE, *PNODE;
static PNODE create_list(void);
static void traverse_list(PNODE pHead);
bool is_empty(PNODE pHead);
int length_list(PNODE pHead);
bool insert_list(PNODE, int, int);
bool delete_list(PNODE, int, int * );
void sort_list(PNODE);
int main(void)
{
int len = 0;
int val;
PNODE pHead = NULL; //<=>struct Node *pHead = NULL
pHead = create_list();
traverse_list(pHead);
printf("/**********Find the length of the list*********/\n");
len = length_list(pHead);
printf("The length of the list is the %d\n", len);
printf("\n");
printf("\n");
printf("\n");
printf("/**********Insert a node***********************/\n");
insert_list(pHead, 3, 102);
traverse_list(pHead);
printf("\n");
printf("\n");
printf("\n");
printf("/**********To sort the list********************/\n");
sort_list(pHead);
traverse_list(pHead);
printf("\n");
printf("\n");
printf("\n");
printf("/**********To delete a node********************/\n");
if (delete_list(pHead, 3, &val))
{
printf("Successfully deleted, you delete the elements is: %d\n", val);
}
else
{
printf("Delete failed, you remove the element does not exist!\n");
}
traverse_list(pHead);
printf("\n");
printf("\n");
printf("\n");
printf("/****Determine whether the list is empty*******/\n");
if (is_empty(pHead))
{
printf("The List is empty\n");
}
else
{
printf("The list is not empty\n");
}
printf("\n");
printf("\n");
printf("\n");
return 0;
}
PNODE create_list(void)
{
int i;
int len;
int val;
PNODE pHead = NULL;
PNODE pTail = NULL;
PNODE pNew = NULL;
pHead = malloc(sizeof(NODE));
if (pHead == NULL)
{
printf("Allocation failure, Program termination");
exit(-1);
}
pTail = pHead;
pTail->pNext = NULL;
printf("Please enter a number of linked list nodes that you want to build: len = ");
scanf("%d", &len);
for (i = 0; i < len; i++)
{
printf("Please enter the %d node value = ", i+1);
scanf("%d", &val);
pNew = malloc(sizeof(NODE));
if (pNew == NULL)
{
printf("Allocation failure, Program termination!");
exit(-1);
}
pNew->data = val;
pTail->pNext = pNew;
pNew->pNext = NULL;
pTail = pNew;
}
return pHead;
}
void traverse_list(PNODE pHead)
{
PNODE p = pHead->pNext;
while (p != NULL)
{
printf("%d ", p->data);
p = p->pNext;
}
printf("\n");
return;
}
bool is_empty(PNODE pHead)
{
if (pHead->pNext == NULL)
{
return true;
}
else
{
return false;
}
}
int length_list(PNODE pHead)
{
PNODE p = pHead->pNext;
int len = 0;
while (p != NULL)
{
++len;
p = p->pNext;
}
return len;
}
void sort_list(PNODE pHead)
{
int i, j, t;
PNODE p, q;
int len = length_list(pHead);
for (i = 0, p = pHead->pNext; i < len -1; ++i, p = p->pNext)
{
for (j = i + 1, q = p->pNext; j < len; ++j, q = q->pNext)
{
if (p->data > q->data)
{
t = p->data;
p->data = q->data;
q->data = t;
}
}
}
return;
}
bool insert_list(PNODE pHead, int pos, int val)
{
int i = 0;
PNODE p = pHead;
PNODE pNew = NULL;
PNODE q = NULL;
while (p != NULL && i < pos -1)
{
p = p->pNext;
++i;
}
if (i > pos -1 || NULL == p)
{
return false;
}
pNew = (PNODE)malloc(sizeof(NODE));
if (pNew == NULL)
{
printf("Dynamic memory allocation failure");
exit(-1);
}
pNew->data = val;
q = p->pNext;
p->pNext = pNew;
pNew->pNext = q;
return true;
}
bool delete_list(PNODE pHead, int pos, int *pVal)
{
int i = 0;
PNODE p = pHead;
PNODE pNew = NULL;
PNODE q = NULL;
while (p->pNext != NULL && i < pos -1)
{
p = p->pNext;
++i;
}
if (i > pos -1 || p->pNext == NULL)
{
return false;
}
q = p->pNext;
*pVal = q->data;
p->pNext = p->pNext->pNext;
free(q);
q = NULL;
return true;
}</span>
运行结果如下:
[root@localhost struct_list]# ./list1
Please enter a number of linked list nodes that you want to build: len = 5
Please enter the 1 node value = 11
Please enter the 2 node value = 23
Please enter the 3 node value = 31
Please enter the 4 node value = 5
Please enter the 5 node value = 24
11 23 31 5 24
/**********Find the length of the list*********/
The length of the list is the 5
/**********Insert a node***********************/
11 23 102 31 5 24
/**********To sort the list********************/
5 11 23 24 31 102
/**********To delete a node********************/
Successfully deleted, you delete the elements is: 23
5 11 24 31 102
/****Determine whether the list is empty*******/
The list is not empty