C语言线性表删除元素算法实现：删除小于min和大于max的值

#include <stdio.h> #include <stdlib.h> #define MAXSIZE 20 typedef int ElementType; typedef int Position; typedef struct LNode List; struct LNode { ElementType Data[MAXSIZE]; Position last; / 线性表的长度*/ };

List Delete( List &L, ElementType minD, ElementType maxD ) { int i, j; for(i = 0, j = 0; i <= L->last; i++) { if(L->Data[i] >= minD && L->Data[i] <= maxD) { L->Data[j++] = L->Data[i]; } } L->last = j - 1; return L; }

List ReadInput() { int num, i; List L = (List)malloc(sizeof(struct LNode)); scanf("%d", &num); for(i = 0; i < num; i++) { scanf("%d", &(L->Data[i])); } L->last = num - 1; return L; }

void PrintList( List L ) { int i; for(i = 0; i <= L->last; i++) { printf("%d ", L->Data[i]); } }

int main() { List L; ElementType minD, maxD; L = ReadInput(); scanf("%d %d", &minD, &maxD); L = Delete(L, minD, maxD); PrintList(L); return 0; }