PTA 資料結構與演算法題目集(中文)6-2
阿新 • • 發佈:2018-12-24
本題要求實現順序表的操作集。
函式介面定義:
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.
解答:
List MakeEmpty()
{
List L=(List)malloc(sizeof(struct LNode));
L->Last=-1;
return L;
}
Position Find( List L, ElementType X )
{
Position i;
for(i=0;i<=L->Last;i++)
{
if(L->Data[i]==X)
return i;
}
return ERROR;
}
bool Insert( List L, ElementType X, Position P )
{
Position i;
if(L->Last>=MAXSIZE-1)
{
printf("FULL");
return false;
}
else if(P<0||P>L->Last+1)
{
printf("ILLEGAL POSITION");
return false;
}
else
{
for(i=L->Last;i>=P;i--)
{
L->Data[i+1]=L->Data[i];
}
L->Data[P]=X;
L->Last++;
return true;
}
}
bool Delete( List L, Position P )
{
Position i;
if(P<0||P>L->Last)
{
printf("POSITION %d EMPTY",P);
return false;
}
else{
for(i=P;i<L->Last;i++)
{
L->Data[i]=L->Data[i+1];
}
L->Last--;
return true;
}
}