线性表

已知线性表A的长度为n ,并采用顺序存储结构。编写算法，删除线性表中值为x的元素

#include<stdio.h>
#include<stdlib.h>
#define ERROR 0
#define TRUE 1
#define LIST_INIT_SIZE 100 /*线性表存储空间的初始分配量*/
#define LISTINCREMENT 10  /*线性表存储空间的分配增量*/
typedef int ElemType;
typedef struct
{
 ElemType *elem;   /*存储空间的基址*/
 int length;       /*当前长度*/
 int listsize;     /*当前分配的存储容量*/
}SqList;

ElemType *newbase;

int init_SqList(SqList *L) {
 /*构造一个空的线性表L*/
 L->elem = (ElemType *)malloc(LIST_INIT_SIZE * sizeof(ElemType));
 if (!L->elem) return ERROR;  /*存储分配失败*/
 L->length = 0;                  /*空表长度为0*/
 L->listsize = LIST_INIT_SIZE; /*初始存储容量*/
 return TRUE;
}
int  insert_SqList(SqList *L, int i, ElemType e)  /*在第i个位置插入元素e*/
{
 if (i<1 || i>L->length + 1)         /*i的位置不合法*/
 {
  return ERROR;
 }
 if (L->length >= L->listsize)      /*当前存储空间已满，增加分配*/
 {
  newbase = (ElemType *)realloc(L->elem, (L->listsize + LISTINCREMENT) * sizeof(ElemType));

  if (!newbase)  return ERROR;
  L->elem = newbase;       /*新基址*/
  L->listsize = L->listsize + LISTINCREMENT;
 }
 ElemType *q,*p;
 q = &(L->elem[i - 1]);              /*q为插入位置*/
 for (p = &(L->elem[L->length - 1]); p >= q; p--)
 {
  *(p + 1) = *p;    /*插入如位置之后的元素右移*/
 }
 *q = e;             /*插入e*/
 L->length++;       /*表长增一*/
 return TRUE;
}

void delete_SqList(SqList *L, int x)/*删除值为x的元素*/
{
 int k = 0;
 for (int i = 0; i < L->length; i++)
 {
  if (L->elem[i] != x)
   L->elem[k++] = L->elem[i];
 }
 L->length = k;
}

void print(SqList *L)
{
 for (int i = 0; i < L->length; i++)
 {
  printf("%d\t", L->elem[i]);
 }
}
int main()
{
 SqList *sqlist;
 sqlist = (SqList *)malloc(sizeof(SqList));
 init_SqList(sqlist);
 insert_SqList(sqlist, 1, 1);
 insert_SqList(sqlist, 2, 2);
 insert_SqList(sqlist, 3, 2);
 insert_SqList(sqlist, 4, 1);
 insert_SqList(sqlist, 5, 3);
 insert_SqList(sqlist, 6, 1);
 print(sqlist);
 getchar();
 delete_SqList(sqlist, 2);
 print(sqlist);
 getchar();
}