第一种:无头结点的链式表操作集
本题要求实现链式表的操作集。
函数接口定义:
Position Find( List L, ElementType X ); List Insert( List L, ElementType X, Position P ); List Delete( List L, Position P );
其中List结构定义如下:
typedef struct LNode *PtrToLNode;
struct LNode {
ElementType Data;
PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;
各个操作函数的定义为:
Position Find( List L, ElementType X ):
返回线性表中首次出现X的位置。若找不到则返回ERROR;
List Insert( List L, ElementType X, Position P )
:将X插入在位置P指向的结点之前,返回链表的表头。如果参数P指向非法位置,则打印“Wrong Position for Insertion”,返回ERROR;
List Delete( List L, Position P )
:将位置P的元素删除并返回链表的表头。若参数P指向非法位置,则打印“Wrong Position for Deletion”并返回ERROR。
裁判测试程序样例:
#include <stdio.h>
#include <stdlib.h>
#define ERROR NULL
typedef int ElementType;
typedef struct LNode *PtrToLNode;
struct LNode {
ElementType Data;
PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;
Position Find( List L, ElementType X );
List Insert( List L, ElementType X, Position P );
List Delete( List L, Position P );
int main()
{
List L;
ElementType X;
Position P, tmp;
int N;
L = NULL;
scanf("%d", &N);
while ( N-- ) {
scanf("%d", &X);
L = Insert(L, X, L);
if ( L==ERROR ) printf("Wrong Answer\n");
}
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 {
L = Delete(L, P);
printf("%d is found and deleted.\n", X);
if ( L==ERROR )
printf("Wrong Answer or Empty List.\n");
}
}
L = Insert(L, X, NULL);
if ( L==ERROR ) printf("Wrong Answer\n");
else
printf("%d is inserted as the last element.\n", X);
P = (Position)malloc(sizeof(struct LNode));
tmp = Insert(L, X, P);
if ( tmp!=ERROR ) printf("Wrong Answer\n");
tmp = Delete(L, P);
if ( tmp!=ERROR ) printf("Wrong Answer\n");
for ( P=L; P; P = P->Next ) printf("%d ", P->Data);
return 0;
}
/* 你的代码将被嵌在这里 */
输入样例:
6
12 2 4 87 10 2
4
2 12 87 5`
输出样例:
2 is found and deleted.
12 is found and deleted.
87 is found and deleted.
Finding Error: 5 is not in.
5 is inserted as the last element.
Wrong Position for Insertion
Wrong Position for Deletion
10 4 2 5
有无头结点的主要区别就是在插入函数上,无头结点的时候要判断L是否等于P,在L=P 的时候,也就是第一次调用insert函数的时候,此时L=P=NULL,插入操作就相当于在空表中插入元素X;
有头结点的时候,则对链表的第一个数据元素的操作就和其他数据元素相同,不用进行特殊处理,也就是函数就不用判断L是否与P相等。
无头结点代码实现:
Position Find( List L, ElementType X )
{
List p=L;
while(p)
{
if(p->Data==X )
{
return p;
}
p=p->Next ;
}
return ERROR;
}
List Insert( List L, ElementType X, Position P )
{
List r,s;
r=L;
//主要区别
if(L==P)
{
r=(List)malloc(sizeof(struct LNode));
r->Data =X;
r->Next =P;
return r;
}
//end
while(r)
{
if(r->Next==P)
{
s=(List )malloc(sizeof(struct LNode));
s->Data =X;
s->Next =r->Next ;
r->Next =s;
return L ;
}
r=r->Next ;
}
printf("Wrong Position for Insertion\n");
return ERROR;
}
List Delete( List L, Position P )
{
List r;
r=L;
if(L==P)
{
return L->Next ;
}
while(r )
{
if(r->Next ==P)
{
r->Next =r->Next->Next ;
free(P);
return L;
}
r=r->Next ;
}
printf("Wrong Position for Deletion\n");
return ERROR;
}
下面是有头结点的操作:(除了insert函数有区别和增加了一个建立空表的函数外,其他函数几乎无区别)
本题要求实现带头结点的链式表操作集。
函数接口定义:
List MakeEmpty();
Position Find( List L, ElementType X );
bool Insert( List L, ElementType X, Position P );
bool Delete( List L, Position P );
其中List结构定义如下:
typedef struct LNode *PtrToLNode;
struct LNode {
ElementType Data;
PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;
各个操作函数的定义为:
List MakeEmpty():创建并返回一个空的线性表;
Position Find( List L, ElementType X ):返回线性表中X的位置。若找不到则返回ERROR;
bool Insert( List L, ElementType X, Position P ):将X插入在位置P指向的结点之前,返回true。如果参数P指向非法位置,则打印“Wrong Position for Insertion”,返回false;
bool Delete( List L, Position P ):将位置P的元素删除并返回true。若参数P指向非法位置,则打印“Wrong Position for Deletion”并返回false。
注意这里面函数的返回值和前面一道题不太一样!
裁判测试程序样例:
#include <stdio.h>
#include <stdlib.h>
#define ERROR NULL
typedef enum {false, true} bool;
typedef int ElementType;
typedef struct LNode *PtrToLNode;
struct LNode {
ElementType Data;
PtrToLNode Next;
};
typedef PtrToLNode Position;
typedef PtrToLNode List;
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;
bool flag;
L = MakeEmpty();
scanf("%d", &N);
while ( N-- ) {
scanf("%d", &X);
flag = Insert(L, X, L->Next);
if ( flag==false ) printf("Wrong Answer\n");
}
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 {
flag = Delete(L, P);
printf("%d is found and deleted.\n", X);
if ( flag==false )
printf("Wrong Answer.\n");
}
}
flag = Insert(L, X, NULL);
if ( flag==false ) printf("Wrong Answer\n");
else
printf("%d is inserted as the last element.\n", X);
P = (Position)malloc(sizeof(struct LNode));
flag = Insert(L, X, P);
if ( flag==true ) printf("Wrong Answer\n");
flag = Delete(L, P);
if ( flag==true ) printf("Wrong Answer\n");
for ( P=L->Next; P; P = P->Next ) printf("%d ", P->Data);
return 0;
}
/* 你的代码将被嵌在这里 */
输入和输出样例同上
代码实现:
List MakeEmpty()
{
List L = (List)malloc(sizeof(List));
L->Next=NULL;
return L;
}
Position Find( List L, ElementType X )
{
List p=L->Next ;
while(p)
{
if(p->Data==X )
{
return p;
}
p=p->Next ;
}
return ERROR;
}
bool Insert( List L, ElementType X, Position P )
{
List r,s;
r=L;
while(r)
{
if(r->Next==P)
{
s=(List )malloc(sizeof(struct LNode));
s->Data =X;
s->Next =r->Next ;
r->Next =s;
return true ;
}
r=r->Next ;
}
printf("Wrong Position for Insertion\n");
return false;
}
bool Delete( List L, Position P )
{
List r;
r=L;
if(L==P)
{
L= L->Next ;
return true;
}
while(r )
{
if(r->Next ==P)
{
r->Next =r->Next->Next ;
free(P);
return true;
}
r=r->Next ;
}
printf("Wrong Position for Deletion\n");
return false;
}