pat之单链表操作集

本题要求实现链式表的操作集。

函数接口定义：

Position Find( List L, ElementType X );
List Insert( List L, ElementType X, Position P );
List Delete( List L, Position P );

裁判测试程序样例：

#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中找值为X的结点指针 
Position Find( List L, ElementType X ){
	//L非空时判定L的数据是否是要找的，是就返回L不是就把L的下一个赋值给L 
	while(L!=NULL){
		if(L->Data==X) 
		{
		return L;
		}
		else
		{
		L=L->Next;
		}
	}
	//没找到 
	return ERROR;
} 
//将X插入在位置P指向的结点之前，返回链表的表头。
//如果参数P指向非法位置，则打印“Wrong Position for Insertion”，返回ERROR
List Insert( List L, ElementType X, Position P )
{
	List l=L;
	List p=(List)malloc(sizeof(struct LNode));
	if(l==NULL){
		printf("Wrong Position for Insertion");
		return ERROR;
	}
	//如果插入在头结点之前 
	if(L==P){
		p->Data=X;
		p->Next=L;
		L=p;
		return L;
	}
	//找到指向P的前一个结点 
	while(l->Next!=NULL){
		if(P==l->Next){
			break;
		}else{
			l=l->Next;
		}
	}
	//没找到 
	if(l->Next==NULL){
		printf("Wrong Position for Insertion");
		return ERROR;
	}else{
		p->Data=X;
		p->Next=P;
		l->Next=p;
		return L;
	}
}

 //将位置P的元素删除并返回链表的表头。
 //若参数P指向非法位置，则打印“Wrong Position for Deletion”并返回ERROR。
List Delete( List L, Position P ){
	//L为空表时错误 
	if(L=NULL){
		printf("Wrong Position for Deletion");
		return ERROR;
	}
	List l=L;
	//当P为头结点且l只有一个结点时 
	if(l==P&&l->Next==NULL){
		free(l);
		return NULL;
	}
	//P为头结点且L不只一个结点 
	if(l==P&&l->Next!=NULL){
		l=l->Next;
		free(P);
		return l;
	}
	//找到P的前一个结点 
	while(l->Next!=NULL){
		if(l->Next==P){
			break;
		}else
		l=l->Next;
	}
	//没找到P 
	if(l->Next==NULL){
		printf("Wrong Position for Deletion");
		return ERROR;
	}
	else{
		l->Next=P->Next;
		free(P);
		return L;
	}
}

**--------------------------------------------------------------------------------------------------更新：有很多地方可以优化，重新写了一遍：

Position Find( List L, ElementType X )
{
	List T = L;
	if(!L)
	return ERROR;
	while(T)
	{
		if( T->Data==X )
		return T;
		T = T->Next;
	}
	return ERROR;
}
List Insert( List L, ElementType X, Position P )
{
	List T = L;
    if( L==P )//第一次进入的时候相当于建表，和后面的插入不一样。 
	{
    T = (List)malloc(sizeof(struct LNode));	
	T->Data = X;
	T->Next = P;
	return T;
	}
	while( L&&L->Next!=P )  
	L = L->Next;
	
	if(!L)
	{
	printf( "Wrong Position for Insertion\n" );
	return ERROR;
	} 
    L->Next = (List)malloc(sizeof(struct LNode));
    L->Next->Data = X;
    L->Next->Next = P;
    
	return T;
}
 
List Delete( List L, Position P )
{
	if( L==P )
	{ 
	List T=L;
	L = L->Next;
	free(T);
	return L;
	}	
	List H = L;	
    while(L&&L->Next!=P)
        L = L->Next;
    if(!L)
    {
    printf( "Wrong Position for Deletion\n" );
    return ERROR;
    }
    
	L->Next = P->Next;
	free(P);
	
	return H;
}