#include<stdio.h>
#define MAXSIZE 100
typedef struct
{
int elem[MAXSIZE];
int length;
} SqList;
void SqList_disploy(SqList L) //遍历输出各个元素
{
int i;
for (i = 0; i <= L.length - 1;i++)
printf("%4d", L.elem[i]);
printf("\n");
}
int SqList_search(SqList L,int x) //查找x元素的位置
{
int i;
for (i = 1; i <= L.length && L.elem[i - 1] != x; i++);
if (i <= L.length)
return i;
else
return 0;
}
SqList SqList_delete(SqList L,int k)//删除第k个元素
{
int j;
if(k<1||k>L.length)
printf("ERROR!");
else
{
for (j = k; j < L.length;j++)
L.elem[j - 1] = L.elem[j];
L.length--;
}
return L;
}
int main()
{
SqList L;
int j,x,q;
printf("请输入插入元素的个数：\n");
scanf("%d",&L.length);
printf("\n请输入各个元素的值：\n");
for (j = 0; j <= L.length - 1;j++)
scanf("%d",&L.elem[j]);
SqList_disploy(L);
printf("\n请输入要查找的值：\n");
scanf("%d", &x);
if(SqList_search(L, x))
printf("\n查找成功！%dis第%d个元素\n",x,SqList_search(L,x));
else
{
printf("\n查找失败！\n");
}
printf("\n请输入要删除元素的位置：\n");
scanf("%d",&q);
L = SqList_delete(L, q);
SqList_disploy(L);
}
