c语言顺序表诸函数怎么写 顺序表的取值c语言代码( 三 )


}
********************************************主函数.c*************************************************
#include stdio.h
#include stdlib.h
#include "顺序表.h"
#include "源代码.h"
//--------------------主函数入口--------------------
int main(){
SqList L;
int size, inc;
int e;
int a;
int length;
int i;
int temp;
int j=10;
int ee;
printf("\n--------------------顺序表初始化------------------\n");
printf("请输入顺序表的长度size以及扩容量:\n");
scanf_s("%d %d", size, inc);
InitList_Sq(L, size, inc);
CreateList_Sq(L);
printf("\n--------------------判断是否为空------------------\n");
if(ListEmpty_Sq(L)){
printf("该顺序表为空\n");
}
else
printf("该顺序表不为空\n");
printf("\n--------------------遍历顺序表--------------------\n");
printf("此时顺序表为:\n");
print_Sq(L);
printf("\n--------------------查找元素----------------------\n");
printf("\n请输入要查找的元素:\n");
scanf_s("%d",e);
a = Search_Sq(L, e);
printf("%d为第%d位:\n",e,a);
printf("\n--------------------输出长度----------------------\n");
length = ListLength_Sq(L);
printf("顺序表的长度为%d\n",length);
printf("\n----------将顺序表L中第i个元素赋值为temp----------\n");
printf("请输入第i个元素的i值和temp值:\n");
scanf_s("%d %d",i,temp);
PutElem_Sq(L, i, temp);
printf("\n此时顺序表为:\n");
print_Sq(L);
printf("\n---------------在顺序表表尾添加元素---------------\n");
Append_Sq(L, j);
printf("\n此时顺序表为:\n");
print_Sq(L);
printf("\n---------------在顺序表表尾删除元素---------------\n");
DeleteLast_Sq(L, ee);
printf("\n被删除的元素为%d\n",ee);
printf("此时顺序表为:\n");
print_Sq(L);
printf("\n-------------------清空顺序表---------------------\n");
ClearList_Sq(L);
if(ListEmpty_Sq(L)){
printf("\n清空成功\n");
}
printf("\n------------------销毁顺序表----------------------\n");
DestroyList_Sq(L);
getchar();
getchar();
return 0;
}
用C语言编写一个有关顺序表的程序代码#include stdio.h
#include malloc.h
#define MaxSize 50
typedef char ElemType;
typedef struct
{
ElemType elem[MaxSize];
int length;
}SqList;
void InitList(SqList *L)/* 初始化顺序表 */
{
L=(SqList *)malloc(sizeof(SqList));
L-length=0;
}
void CreateListR(SqList *L,ElemType a[],int n)/*创建顺序表*/
{
int i;
for(i=0;in;i++)
L=(SqList *)malloc(sizeof(SqList));
L-elem[i]=a[i];
L-length++;
}
void DispList(SqList *L)/* 输出顺序表 */
{
int i;
if(ListEmpty(L)) return;
for(i=0;iL-length;i++)
printf("%c",L-elem[i]);
printf("\n");
}
int ListLength(SqList *L)/* 求顺序表的长度 */
{
return(L-length);
}
int ListEmpty(SqList *L)/* 求顺序表是否为空 */
{
return(L-length==0);
}
int GetElem(SqList *L,int i,ElemType e)/*求顺序表中某个数据的元素值 */
{
if(i1||iL-length)
return 0;
else
e=L-elem[i-1];
return 1;
}
int LocateElem(SqList *L,ElemType e)/*按值查找元素*/
{
int i=0;
while(iL-lengthL-elem[i]!=e) i++;
if(i=L-length)
return 0;
else
return i+1;
}
int ListInsert(SqList *L,int i,ElemType e)/*按i位置插入元素*/
{
int j;
if(i1||iL-length+1)
return 0;
i--;
for (j=L-length;ji;j--)
L-elem[j]=L-elem[j-1];
L-elem[i]=e;

推荐阅读