C++ 实现线性表删除指定范围元素的 Delete 函数

#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);

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

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

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

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