7.完成P45例2-3:
建立一个表,首先依次输入数据元素 1,2,3,…,10,然后删除数据元素 5,最后一次显示当前表中的数据元素。要求使用单链表。
头文件:LinList.h
#include<stdio.h>
#include<stdlib.h>
typedef int DataType;
typedef struct Node
{
DataType data;
struct Node* next;
}SLNode;
void ListInitiate(SLNode** head)
{
*head = (SLNode*)malloc(sizeof(SLNode));
(*head)->next = NULL;
}
int ListLength(SLNode* head)
{
SLNode* p = head;
int size = 0;
while (p->next != NULL)
{
p = p->next;
size++;
}
return size;
}
int ListInsert(SLNode* head, int i, DataType x)
{
SLNode* p, * q;
int j;
p = head;
j = -1;
while (p->next != NULL && j < i - 1)
{
p = p->next;
j++;
}
if (j != i - 1)
{
printf("插入位置参数错!");
return 0;
}
q = (SLNode*)malloc(sizeof(SLNode));
q->data = x;
q->next = p->next;
p->next = q;
return 1;
}
int ListDelete(SLNode* head, int i, DataType* x)
{
SLNode* p, * s;
int j;
p = head;
j = -1;
while (p->next != NULL && p->next->next != NULL && j < i - 1)
{
p = p->next;
j++;
}
if (j != i - 1)
{
printf("删除元素位置参数错!");
return 0;
}
s = p->next;
*x = s->data;
p->next = p->next->next;
free(s);
return 1;
}
int ListGet(SLNode* head, int i, DataType* x)
{
SLNode* p;
int j;
p = head;
j = -1;
while (p->next != NULL && j < i)
{
p = p->next;
j++;
}
if (j != i)
{
printf("取元素位置参数错!");
return 0;
}
*x = p->data;
return 1;
}
void Destroy(SLNode** head)
{
SLNode* p, * p1;
p = *head;
while (p != NULL)
{
p1 = p;
p = p->next;
free(p1);
}
*head = NULL;
}
源文件:LinList.c
#include"LinList.h"
int main()
{
SLNode* head;
int i, x;
ListInitiate(&head);
for (i = 0; i < 10; i++)
ListInsert(head, i, i + 1);
ListDelete(head, 4, &x);
for (i = 0; i < ListLength(head); i++)
{
ListGet(head, i, &x);
printf("%d ", x);
}
Destroy(&head);
return 0;
}