数据结构-线性表

This commit is contained in:
lzy
2024-04-13 20:08:53 +08:00
parent 51c29273f3
commit 9bc7edbf47
8 changed files with 288 additions and 4 deletions

View File

@@ -0,0 +1,131 @@
#include <stdio.h>
#include <stdlib.h>
#include "sqlist.h"
sqlist *sqlist_create()
{
sqlist *me;
me = malloc(sizeof(*me));
if (NULL == me)
return NULL;
me->last = -1;
return me;
}
void sqlist_create1(sqlist **ptr)
{
*ptr = malloc(sizeof(**ptr));
if (NULL == *ptr)
return;
(*ptr)->last = -1;
return;
}
int sqlist_insert(sqlist *me, int i, datatype *data)
{
int j;
if (DATASIZE - 1 == me->last)
return -1;
if (i < 0 || i > me->last + 1)
return -2;
for (j = me->last; i <= j; j--)
{
me->data[j + 1] = me->data[j];
}
// TODO: 仅限常规数据结构
me->data[i] = *data;
me->last++;
return 0;
}
int sqlist_delete(sqlist *me, int i)
{
int j;
if (i < 0 || i > me->last)
return -1;
for (j = i + 1; j <= me->last; j++)
{
me->data[j - 1] = me->data[j];
}
me->last--;
return 0;
}
int sqlist_find(sqlist *me, datatype *data)
{
if (0 == sqlist_isempty(me))
return -1;
for (int i = 0; i < me->last; i++)
{
if (me->data[i] == *data)
return i;
}
return -2;
}
int sqlist_isempty(sqlist *me)
{
if (-1 == me->last)
return 0;
return -1;
}
int sqlist_setempty(sqlist *me)
{
me->last = -1;
return 0;
}
int sqlist_getnum(sqlist *me)
{
return me->last + 1;
}
void sqlist_display(sqlist *me)
{
if (-1 == me->last)
return;
for (int i = 0; i <= me->last; i++)
{
printf("%d ", me->data[i]);
}
printf("\n");
}
int sqlist_destroy(sqlist *me)
{
free(me);
return 0;
}
int sqlist_union(sqlist *list1, sqlist *list2)
{
// list1 -> 12 23 34 45 56
// list2 -> 78 89 56 23 10
int i = 0;
for (i = 0; i <= list2->last; i++)
{
if (sqlist_find(list1, &list2->data[i]) < 0)
{
sqlist_insert(list1, 0, &list2->data[i]);
}
}
}