#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#include<math.h>

#define MAX 40

typedef struct {
int *elem;
int length;
int listsize;
}SqList;

int InitList_Sq( SqList &L ) {
L.elem = ( int * )malloc( MAX * sizeof( int ) );
if( ! L.elem ) exit( -2 );
L.length = 20;
L.listsize = MAX;
return 1;
}
int DeleteOddNumbers( SqList &L ) {
int i = 0,j,k,m;
int *p,*q;
for( i ; i < L.length ; i ++ ) {
k = 0;
for( j = 1 ; j <= sqrt(L.elem[i]) ; j ++ ) {
m = L.elem[i] % j;
if( m == 0 ) k ++ ;
}
if( k < 2 ) {
p = &(L.elem[i - 1]);
q = L.elem + L.length - 1;
for( ++p ; p <= q ; ++p )
*(p-1) = *p;
-- L.length;
i --;
}
}
return 1;
}
int main () {
SqList a;
InitList_Sq( a );
printf("Input L:");
for( int i = 0; i < a.length ; i ++ )
scanf("%d",&a.elem[i]);
for( i = 0; i < a.length ; i ++ )
printf("%d ",a.elem[i]);
printf("\n");
DeleteOddNumbers(a);
for( i = 0 ; i < a.length ; i ++ )
printf("%d ",a.elem[i]);
printf("\n");
getch();
free( a.elem );
return 0;
}
删除顺表中所有为奇数的项

#include <stdio.h>
#include <stdlib.h>
#define LISTSIZE 10
#define INCREMENT 10

typedef struct
{
int *elem;
int length;
int listsize;
}SqList;

static void InitialList(SqList *L);
static void CreateList(SqList *L, int n);
static void DeleteElem(SqList *L);
static void VisitList(SqList L);
static void DestroyList(SqList *L);

int main(void)
{
SqList L;
int n;

InitialList(&L);

printf("Enter number n: "); /* n代表元素个数 */
scanf("%d", &n);

CreateList(&L, n);

VisitList(L);

DeleteElem(&L); /* 删除顺序表中所有奇数项 */

VisitList(L);

DestroyList(&L);

return 0;
}

static void InitialList(SqList *L)
{
if ((((*L).elem = (int*)malloc(sizeof(int) * LISTSIZE))) == NULL)
{
exit(1);
}
(*L).length = 0;
(*L).listsize = LISTSIZE;
}

static void CreateList(SqList *L, int n)
{
int i;

for (i = 0; i < n; i++)
{
scanf("%d", &(*L).elem[(*L).length++]) ;
if ((*L).length >= (*L).listsize)
{
if ((((*L).elem = (int*)realloc((*L).elem, sizeof(int) *((*L).listsize + INCREMENT)))) == NULL)
{
exit(1);
}
(*L).listsize += INCREMENT;
}
}
}

static void DeleteElem(SqList *L)
{
int *p, *q, i;

for (i = 0; i < (*L).length; i++)
{
p = &(*L).elem[i];
for (q = p + 1; q <= &(*L).elem[(*L).length - 1]; q++)
{
*(q - 1) = *q;
}
(*L).length--;
}
}

static void VisitList(SqList L)
{
int i;

for (i = 0; i < L.length; i++)
{
printf("%d ", L.elem[i]);
}
printf("\n");
}

static void DestroyList(SqList *L)
{
if ((*L).elem != NULL)
{
free((*L).elem);
(*L).elem = NULL;
}
(*L).length = 0;
}