十裡冬の小站

1
#include<stdio.h>
2
#include<stdlib.h>
3
#define OK 1
4
#define ERROR 2
5
#define OVERFLOW 3
6
#define INIT_LIST_SIZE 100
7

8
typedef int Status;
9
typedef int ElemType;
10

11
typedef struct Lnode{
12
    ElemType data;
13
    struct Lnode *next;
14
}Lnode,*Linklist;
15

16
Status Initsq(Linklist &L){
17
    L=(Linklist)malloc(sizeof(Lnode));
18
    if(!L){
19
        return ERROR;
20
    }
21
    L->next=NULL;
22
    return OK;
23
}
24

25
//获取
26
Status GetElem(Linklist L,int i,ElemType &e){
27
    Linklist p;
28
    int j;
29
    p=L->next;
30
    j=1;
31
    while(p&&j<i){
32
        p=p->next;
33
        j++;
34
    }
35
    if(!p||j>i){
36
        return ERROR;
37
    }
38
    e=p->data;
39
    return OK;
40
}
41

42
//插入
43
Status Insertsq(Linklist &L,int i,ElemType e){
44
    Linklist p,q;
45
    int j;
46
    p=L;
47
    j=0;
48
    while(p&&j<i-1){
49
        p=p->next;
50
        j++;
51
    }
52
    if(!p||j>i){
53
        return ERROR;
54
    }
55
    q=(Linklist)malloc(sizeof(Lnode));
56
    q->data=e;
57
    q->next=p->next;
58
    p->next=q;
59
    return OK;
60
}
61

62
//删除
63
Status Deletesq(Linklist &L,int i,ElemType &e){
64
    Linklist p,q;
65
    int j;
66
    p=L;
67
    j=0;
68
    while(p->next&&j<i-1){
69
        p=p->next;
70
        j++;
71
    }
72
    if(!p->next||j>i){
73
        return ERROR;
74
    }
75
    q=p->next;
76
    e=q->data;
77
    p->next=q->next;
78
    free(q);
79
    return OK;
80
}
81

82
int main(){
83
    Linklist list;
84
    ElemType x;
85
    int i;
86
    if(!Initsq(list)){
87
    return OVERFLOW;}
88
    printf("Insert 10 elements:\n");
89
    for(i=1;i<=10;i++){
90
        x=rand()%100;
91
        printf("%d\n",x);
92
        Insertsq(list,i,x);
93
    }
94
    printf("Delete 10 elements:\n");
95
    for(i=10;i>=1;i--){
96
        Deletesq(list,i,x);
97
        printf("%d\n",x);
98
    }
99
    return OK;
100
}