线性表链式存储结构——单链表——C语言

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
//线性表链式存储结构——单链表
typedef int ElemType; 
typedef struct Node
{
    ElemType data;
    struct Node *next;
} Node, *LinkList;
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
typedef int Status;
Status GetElem (LinkList L, int i, ElemType *e);//获取第i个元素，返回给e 
Status ListInsert (LinkList *L, int i, ElemType e);//在第i个位置插入元素e 
Status ListDelete(LinkList *L, int i, ElemType *e); //删除第i个元素，并将删除的值返回给e 
void CreateListHead(LinkList *L, int n); //前插法 
void CreateListTail(LinkList *L, int n);//后插法 
Status ClearList(LinkList *L);//清空线性表 
void LookList(LinkList L);
int main()
{
	int i,n;
	ElemType e;
    LinkList L;
    printf("你要创建含有多少个元素的链表：\n");
    scanf("%d",&n);
    CreateListHead(&L,n);
    //CreateListeTail(&L,n);
    LookList(L);
    printf("你想要获取第几个元素：\n");
    scanf("%d",&i);
    GetElem(L,i,&e);
    printf("第%d个元素为%d\n",i,e);
    printf("你想要删除第几个元素：\n");
    scanf("%d",&i);
    ListDelete(&L,i,&e);
    printf("你删除的第%d个元素为%d",i,e);
    LookList(L);
    printf("你想要在哪个位置插入元素：\n");
    scanf("%d",&i);
    ListInsert(&L,i,e);
    LookList(L);
    ClearList(&L);
    LookList(L);
    
}
void LookList(LinkList L)
{
	Node *p;
	p=L->next;
	printf("链表元素如下：\n"); 
	while(p)
	{
		printf("%d ",p->data);
		p=p->next;
	}
	printf("\n");
 } 

Status GetElem (LinkList L, int i, ElemType *e)
{
    int j;
    LinkList p;
    p = L->next;
    j=1;
    while(p && j<i)
    {
        p=p->next;
        ++j;
    }
    if(!p || j>i)
        return ERROR;
    *e = p->data;
    return OK;
}
Status ListInsert (LinkList *L, int i, ElemType e)
{
    int j;
    LinkList p,s;
    p = *L;
    j=1;
    while(p && j<i)
    {
        p = p->next;
        ++j;
    }
    if(!p || j>i)
        return ERROR;
    s = (LinkList)malloc(sizeof(Node));
    s->data=e;
    s->next=p->next;
    p->next=s;
    return OK;
}
/*初始条件：顺序线性表L已存在，1≤i≤ListLength（L） */
/*操作结果：删除L的第i个数据元素，并用e返回其值，L的长度减1*/
Status ListDelete(LinkList *L, int i, ElemType *e)
{
    int j;
    LinkList p, q;
    p = *L;
    j = 1;
    while (p->next && j < i)    /*遍历寻找第i个元素*/
    {
         p = p->next;
         ++j;
    }
    if (!p->next || j > i)
        return ERROR;        /*第i个元素不存在*/
    q = p->next;
    p->next = q->next;        /*将q的后继赋值给p的后继*/
    *e = q->data;             /*将q结点中的数据给e*/
    free(q);                  /*让系统回收此结点，释放内存*/
    return OK;
}
/* 随机产生n个元素的值，建立带表头结点的单链线性表L（头插法）*/
void CreateListHead(LinkList *L, int n)
{
    LinkList p;
    int i;
    srand(time(0));
	*L = (LinkList)malloc(sizeof(Node));
    (*L)->next = NULL;                    /*先建立一个带头结点的单链表*/
    for (i=0; i<n; i++)
    {
        p = (LinkList)malloc(sizeof(Node));/*生成新结点*/
        p->data = rand() % 100 + 1;          /*随机生成100以内的数字*/
        p->next = (*L)->next;
        (*L)->next = p;                  /*插入到表头*/
    }
}
/* 随机产生n个元素的值，建立带表头结点的单链线性表L（尾插法）*/
void CreateListTail(LinkList *L, int n)
{
    LinkList p,r;
    int i;
    srand(time(0)); 
	*L = (LinkList)malloc(sizeof(Node));                     /* Initialize random number seed */
    r = *L;                                /* r points to the tail node */
    for (i=0; i<n; i++)
    {
        p = (Node *)malloc(sizeof(Node));  /* Generate a new node */
        p->data = rand() % 100 + 1;        /* Randomly generate a number within 100 */
        r->next = p;                       /* Point the tail node's pointer to the new node */
        r = p;                             /* Define the new node as the tail node */
    }
    r->next = NULL;                        /* Mark the end of the list */
}
/*初始条件：顺序线性表L已存在，操作结果：将L重置为空表*/
Status ClearList(LinkList *L)
{
    LinkList p, q;
    p = (*L)->next;           /* p points to the first node */
    while (p)                 /* Not at the end of the list */
    {
        q = p->next;
        free(p);
        p = q;
    }
    (*L)->next = NULL;        /* The head node's pointer field is empty */
    return OK;
}