郝斌《数据结构》课程源代码
链表的实现
用者自取,自由分享
#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
typedef struct Node
{
int data;
struct Node * pNext;
}NODE, *PNODE;
PNODE create_list(void);
void traverse_list(PNODE pHead);
bool is_empty(PNODE pHead);
bool insert_list(PNODE, int, int);
bool delete_list(PNODE, int, int *);
void sort_list(PNODE);
int length_list(PNODE);
int main(void)
{
PNODE pHead = NULL;
int val;
pHead = create_list();
traverse_list(pHead);
if( is_empty(pHead) )
{
printf("链表为空\n");
}
else
{
printf("链表不为空\n");
}
int len = length_list(pHead);
printf("链表的长度是%d\n", len);
if( delete_list(pHead, 4, &val) )
{
printf("删除成功,您删除的元素是:%d\n", val);
}
else
{
printf("删除失败,您删除的元素不存在\n");
}
traverse_list(pHead);
return 0;
}
PNODE create_list(void)
{
int len;
int i;
int val;
PNODE pHead = (PNODE)malloc(sizeof(NODE));
if(NULL == pHead)
{
printf("内存分配失败,程序终止\n");
exit(-1);
}
PNODE pTail = pHead;
pTail->pNext = NULL;
printf("请输入您需要生成的链表结点的个数:len = ");
scanf("%d", &len);
for(i = 0; i < len; ++i)
{
printf("请输入第%d个结点的值:", i+1);
scanf("%d", &val);
PNODE pNew = (PNODE)malloc(sizeof(NODE));
if(NULL == pNew)
{
printf("内存分配失败,程序终止\n");
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(NULL != p)
{
printf("%d ", p->data);
p = p->pNext;
}
printf("\n");
}
bool is_empty(PNODE pHead)
{
if(NULL == pHead->pNext)
{
return true;
}
else
{
return false;
}
}
int length_list(PNODE pHead)
{
int len = 0;
PNODE p = pHead->pNext;
while(NULL != p)
{
++len;
p = p->pNext;
}
return len;
}
bool insert_list(PNODE pHead, int pos, int val)
{
int i =0;
PNODE p = pHead;
while(NULL != p && i < pos-1)
{
p = p->pNext;
++i;
}
if(i > pos-1 || NULL == p)
{
return false;
}
PNODE pNew = (PNODE)malloc(sizeof(NODE));
if(NULL == pNew)
{
printf("动态内存分配失败\n");
exit(-1);
}
pNew->data = val;
PNODE 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;
while(NULL != p && i < pos-1)
{
p = p->pNext;
++i;
}
if(i > pos-1 || NULL == p)
{
return false;
}
PNODE q = p->pNext;
*pVal = q->data;
p->pNext = p->pNext->pNext;
free(q);
q = NULL;
return true;
}
void sort_list(PNODE pHead)
{
int i, j, t;
int len = length_list(pHead);
PNODE p, q;
for(i = 0, p = pHead->pNext; i < len -1; p = p->pNext)
{
for(j = i + 1, q = p->pNext; j < len; q = q->pNext)
{
if(p->data > q->data)
{
t = p->data;
p->data = q->data;
q->data = t;
}
}
}
}