69,381
社区成员
发帖
与我相关
我的任务
分享
#include <stdio.h>
#include <malloc.h>
#include "SeqList.h"
typedef unsigned int TSeqListNode;
typedef struct _tag_SeqList
{
int capacity;
int length;
TSeqListNode* node;
} TSeqList;//定义结构体
SeqList* SeqList_Create(int capacity) // 传递创建的总数 O(1)
{
TSeqList* ret = NULL;//创建结构体指针
if (capacity >= 0)//总数肯定要大于0的
{
ret = (TSeqList*)malloc(sizeof(TSeqList)+sizeof(TSeqListNode)* capacity);
//分配空间一个结构体的空间加上后面数组空间
}
if (ret != NULL)//判断是否创建失败
{
ret->capacity = capacity;
ret->length = 0;
ret->node = (TSeqListNode*)(ret + 1);//创建一个unsigned int 指针
}
return ret;
}
void SeqList_Destroy(SeqList* list) // O(1)//创建void *list;
{
free(list);
}
void SeqList_Clear(SeqList* list) // O(1)//线性表清零
{
TSeqList* sList = (TSeqList*)list;
if (sList != NULL)
{
sList->length = 0;//把长度清零
}
}
int SeqList_Length(SeqList* list) // 得到其线性表长度 O(1)
{
TSeqList* sList = (TSeqList*)list;
int ret = -1;
if (sList != NULL)
{
ret = sList->length;//
}
return ret;
}
int SeqList_Capacity(SeqList* list) //总数 O(1)
{
TSeqList* sList = (TSeqList*)list;
int ret = -1;
if (sList != NULL)
{
ret = sList->capacity;
}
return ret;
}
//传入结构指针,和数据地址,还有 位置
int SeqList_Insert(SeqList* list, SeqListNode* node, int pos) // 插入O(n)
{
TSeqList* sList = (TSeqList*)list;
int ret = (sList != NULL);
int i = 0;
ret = ret && (sList->length + 1 <= sList->capacity);
ret = ret && (0 <= pos);//表示线性表创建成功
if (ret)
{
if (pos >= sList->length)//如果插入位置大于长度
{
pos = sList->length;//就把插入位置放在最后一个
}
for (i = sList->length; i>pos; i--)
{
sList->node[i] = sList->node[i - 1];//向后移动位置,然后插入
}
sList->node[i] = (TSeqListNode)node;//数据就插入这个位置
sList->length++;
}
return ret;
}
SeqListNode* SeqList_Get(SeqList* list, int pos) // O(1) 得到其元素
{
TSeqList* sList = (TSeqList*)list;//又创建一个结构体指针
SeqListNode* ret = NULL;//创建空指针
if ((sList != NULL) && (0 <= pos) && (pos < sList->length))
{
ret = (SeqListNode*)(sList->node[pos]);// (SeqListNode*)(sList->node[pos]);这为毛是地址,不是一个数组中的值吗,这是为毛
}
return ret;
}
SeqListNode* SeqList_Delete(SeqList* list, int pos) // O(n)
{
TSeqList* sList = (TSeqList*)list;
SeqListNode* ret = SeqList_Get(list, pos);
int i = 0;
if (ret != NULL)
{
for (i = pos + 1; i<sList->length; i++)
{
sList->node[i - 1] = sList->node[i];
}
sList->length--;
}
return ret;
}