// 顺序表//
#include<stdio.h>
#include<stdlib.h>
#define SIZE 100
#define CREM 10
#define OVERFLOW -2
#define OK 1
#define ERROR -1
typedef int ElemType;
typedef struct
{
int *elem;
int length;
int listsize;
}SqList;
void InitList_Sq(SqList &L); // 初始化
void InsertList_Sq(SqList &L,int i,int e); //插入
void DeleteList_Sq(SqList &L,int i,int &e); //删除
int LocateElem_Sq(SqList &L,int &e); //定位
void PrintList_Sq(SqList &L); //输出
int Length_Sq(SqList &L); //长度
int GetData_Sq(SqList &L,int i); //找元素
void CreatList_Sq(SqList &L); // 创建
void ClearList_Sq(SqList &L); //清空
int main()
{
SqList L;
InitList_Sq(L);
ElemType e;
printf("输入数序表元素:"); // -1终止
CreatList_Sq(L);
scanf("%d",&e);
PrintList_Sq(L);
printf("顺序表的长度是:%d\n",Length_Sq(L));
InsertList_Sq(L,1,e);
printf("在顺序表头位置插入元素%d...\n",e);
PrintList_Sq(L);
DeleteList_Sq(L,L.length,e);
printf("在顺序表尾删除元素%d...\n",e);
PrintList_Sq(L);
ClearList_Sq(L);
PrintList_Sq(L);
return 0;
}
void InitList_Sq(SqList &L)
{
L.elem = (ElemType *)malloc(SIZE*sizeof(ElemType));
if(! L.elem) return; //程序退出
L.length = 0;
L.listsize = SIZE;
return ;
} //构造
void InsertList_Sq(SqList &L,int i,int e)
{
if(i < 1 || i > L.length+1) return;
if(L.length >= L.listsize)
{
ElemType *newbase;
newbase = (ElemType *)realloc(L.elem,(L.listsize+CREM)*sizeof(ElemType));
if(! newbase) return;
L.elem = newbase;
L.listsize += CREM;
}
ElemType *q = &(L.elem[i-1]);
for(ElemType *p = &(L.elem[L.length-1]);p >= q;--p)
{
*(p+1)=*p;
}
*q = e;
L.length++;
return;
} //插入
void CreatList_Sq(SqList &L)
{
int i = L.length+1; //长度为1时,是数组里的第一个元素 下标:【0】
ElemType e;
scanf("%d",&e);
while(e != -1)
{
InsertList_Sq(L,i,e);
scanf("%d",&e);
}
return;
} //创建
void DeleteList_Sq(SqList &L,int i,int &e)
{
if(i < 1 || i > L.length) return;
ElemType *p = &(L.elem[i-1]);
e = *p;
ElemType *q = L.elem + L.length -1;
for(++p;p <= q;++p)
*(p-1) = *p;
L.length--;
return;
} // 删除
int LocateElem_Sq(SqList &L,ElemType &e) // 此时的e可以不用引用符号,可以减少值复制消耗的时间,加快速度
//“在函数的传参中,如果传递的是一个引用,意味着这个变量或对象已经存在了;如果传递的是一个指针,则不能判断这个指针是不是有效的,是不是空的,因此在函数体 中大多数都得进行指针是否为空的判断。但是虽然引用较为安全,但是利用指针来传参效率较快。”
{
for(int i = 0;i < L.length;i++ )
{
if(L.elem[i] == e) return i+1;
}
return -1;
} //定位
void PrintList_Sq(SqList &L)
{
if(L.length == 0)
{
printf("顺序表为空\n");
return;
}
printf("顺序表里的元素有:\n");
for(int i = 0;i < L.length;i++)
printf("%3d",L.elem[i]);
printf("\n");
} //输出
int Length_Sq(SqList &L)
{
if(L.length == NULL)
return -1;
return L.length;
} //求表长
ElemType GetData_Sq(SqList &L,int i) //第几个元素
{
if(i < 1 || i > L.length)
return -1;
return L.elem[i-1]; //对应数组里面的[i-1]
} // 取出元素
void ClearList_Sq(SqList &L)
{
printf("正在清空。。。。\n");
L.length = 0;
return;
} //简单的清空操作,并没有销毁
顺序表操作集
最新推荐文章于 2024-08-22 16:17:37 发布