6-2 顺序表操作集
分数 20
全屏浏览题目
切换布局
作者 陈越
单位 浙江大学
本题要求实现顺序表的操作集。
函数接口定义:
List MakeEmpty(); Position Find( List L, ElementType X ); bool Insert( List L, ElementType X, Position P ); bool Delete( List L, Position P );
其中List
结构定义如下:
typedef int Position; typedef struct LNode *List; struct LNode { ElementType Data[MAXSIZE]; Position Last; /* 保存线性表中最后一个元素的位置 */ };
各个操作函数的定义为:
List MakeEmpty()
:创建并返回一个空的线性表;
Position Find( List L, ElementType X )
:返回线性表中X的位置。若找不到则返回ERROR;
bool Insert( List L, ElementType X, Position P )
:将X插入在位置P并返回true。若空间已满,则打印“FULL”并返回false;如果参数P指向非法位置,则打印“ILLEGAL POSITION”并返回false;
bool Delete( List L, Position P )
:将位置P的元素删除并返回true。若参数P指向非法位置,则打印“POSITION P EMPTY”(其中P是参数值)并返回false。
裁判测试程序样例:
#include <stdio.h> #include <stdlib.h> #define MAXSIZE 5 #define ERROR -1 typedef enum {false, true} bool; typedef int ElementType; typedef int Position; typedef struct LNode *List; struct LNode { ElementType Data[MAXSIZE]; Position Last; /* 保存线性表中最后一个元素的位置 */ }; List MakeEmpty(); Position Find( List L, ElementType X ); bool Insert( List L, ElementType X, Position P ); bool Delete( List L, Position P ); int main() { List L; ElementType X; Position P; int N; L = MakeEmpty(); scanf("%d", &N); while ( N-- ) { scanf("%d", &X); if ( Insert(L, X, 0)==false ) printf(" Insertion Error: %d is not in.\n", X); } scanf("%d", &N); while ( N-- ) { scanf("%d", &X); P = Find(L, X); if ( P == ERROR ) printf("Finding Error: %d is not in.\n", X); else printf("%d is at position %d.\n", X, P); } scanf("%d", &N); while ( N-- ) { scanf("%d", &P); if ( Delete(L, P)==false ) printf(" Deletion Error.\n"); if ( Insert(L, 0, P)==false ) printf(" Insertion Error: 0 is not in.\n"); } return 0; } /* 你的代码将被嵌在这里 */
输入样例:
6
1 2 3 4 5 6
3
6 5 1
2
-1 6
输出样例:
FULL Insertion Error: 6 is not in.
Finding Error: 6 is not in.
5 is at position 0.
1 is at position 4.
POSITION -1 EMPTY Deletion Error.
FULL Insertion Error: 0 is not in.
POSITION 6 EMPTY Deletion Error.
FULL Insertion Error: 0 is not in.
#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 5
#define ERROR -1
typedef enum { false, true } bool;
typedef int ElementType;
typedef int Position;
typedef struct LNode* List;
struct LNode {
ElementType Data[MAXSIZE];
Position Last; /* 保存线性表中最后一个元素的位置 */
};
List MakeEmpty();
Position Find(List L, ElementType X);
bool Insert(List L, ElementType X, Position P);
bool Delete(List L, Position P);
int main()
{
List L;
ElementType X;
Position P;
int N;
L = MakeEmpty();
scanf("%d", &N);
while (N--) {
scanf("%d", &X);
if (Insert(L, X, 0) == false)
printf(" Insertion Error: %d is not in.\n", X);
}
scanf("%d", &N);
while (N--) {
scanf("%d", &X);
P = Find(L, X);
if (P == ERROR)
printf("Finding Error: %d is not in.\n", X);
else
printf("%d is at position %d.\n", X, P);
}
scanf("%d", &N);
while (N--) {
scanf("%d", &P);
if (Delete(L, P) == false)
printf(" Deletion Error.\n");
if (Insert(L, 0, P) == false)
printf(" Insertion Error: 0 is not in.\n");
}
return 0;
}
/* 你的代码将被嵌在这里 */
List MakeEmpty() {
List l = (List)malloc(sizeof(struct LNode));//申请空间
l->Last = -1; //空顺序表,最后一个元素为-1
return l;
}
bool Insert(List L, ElementType X, Position P) {
if (L->Last == MAXSIZE - 1) {//表满了
printf("FULL");
return false;
}
else if (P<0 || P>L->Last + 1) {//下标位置不合法
printf("ILLEGAL POSITION");
return false;
}
else {
for (int i = L->Last; i >= P; i--) {//目标位置的元素全部后移
L->Data[i + 1] = L->Data[i];
}
L->Data[P] = X;//插入进表中
L->Last++;//表的容量+1
return true;
}
}
bool Delete(List L, Position P) {
if (P<0 || P>L->Last ) {//判断删除位置是否合法
printf("POSITION %d EMPTY",P);
return false;
}
else {//删除位置之前的元素前移
for (int i = P; i < L->Last; i++) {
L->Data[i] = L->Data[i + 1];
}
L->Last--;//容量-1
return true;
}
}
Position Find(List L, ElementType X) {
for (int i = 0; i <= L->Last; i++) {//遍历查找
if (L->Data[i] == X) {
return i;
}
}
return ERROR;
}