6-5 链式表操作集

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

 

函数接口定义:

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

 

其中List结构定义如下:

1
2
3
4
5
6
7
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。

 

裁判测试程序样例:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#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;
}
 
/* 你的代码将被嵌在这里 */

 

输入样例:

1
2
3
4
6
12 2 4 87 10 2
4
2 12 87 5

 

输出样例:

1
2
3
4
5
6
7
8
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

 

代码:(一次提交就过 注意动态内存分配malloc的使用情况)

 

复制代码
Position Find( List L, ElementType X ){
    while(L!=NULL){
        if(L->Data==X){
            return L;
        }else{
            L=L->Next;
        }
        
    }
    return ERROR;
}
List Insert( List L, ElementType X, Position P ){
    List ll=L;
    if(L==NULL){
        List start=(List)malloc(sizeof(struct LNode));
        start->Data=X;
        start->Next=NULL;
        L=start;
        return L;
    }
    if(L==P){
        List start=(List)malloc(sizeof(struct LNode));
        start->Data=X;
        start->Next=L;
        return start;
    }
    while(L!=NULL){
        if(L->Next==P){
            Position p = (Position)malloc(sizeof(struct LNode));
            p->Next=L->Next;
            p->Data=X;
            L->Next=p;
            return ll;
        }else{
            L=L->Next;
        }
    }
    printf("Wrong Position for Insertion\n");
    return ERROR;
    
    
}
List Delete( List L, Position P ){
    
    List ll=L;
    if(L==P){
        return L->Next;
    }
    while(L!=NULL){
        if(L->Next==P){
            L->Next=P->Next;
            return ll;
        }else{
            L=L->Next;
        }
    }
    printf("Wrong Position for Deletion\n");
    

    return ERROR;
    
    
}
复制代码

 

posted @   Yohoc  阅读(90)  评论(0编辑  收藏  举报
相关博文:
阅读排行:
· 阿里最新开源QwQ-32B,效果媲美deepseek-r1满血版,部署成本又又又降低了!
· 单线程的Redis速度为什么快?
· SQL Server 2025 AI相关能力初探
· AI编程工具终极对决:字节Trae VS Cursor,谁才是开发者新宠?
· 展开说说关于C#中ORM框架的用法!
点击右上角即可分享
微信分享提示