十裡冬の小站

1
//顺序表结构体+main函数
2
#include<stdio.h>
3
#include<stdlib.h>
4
#define OK 1
5
#define ERROR 2
6
#define OVERFLOW 3
7
#define INIT_LIST_SIZE 100
8

9
typedef int Status;
10
typedef int ElemType;
11
typedef struct{
12
    ElemType *elem;
13
    int length;
14
    int listsize;
15
}Sqlist;
16

17
//初始化
18
Status Init_sq(Sqlist &L){
19
    L.elem=(ElemType*)malloc(sizeof(ElemType)*INIT_LIST_SIZE);
20
    if(!L.elem)return OVERFLOW;
21
    L.length=0;
22
    L.listsize=INIT_LIST_SIZE;
23
    return OK;
24
}
25

26
//释放占用内存
27
Status Destroy_Sq(Sqlist &L){
28
    if(!L.elem)return ERROR;
29
    free(L.elem);
30
    L.length=0;
31
    L.listsize=0;
32
    L.elem=NULL;
33
    return OK;
34
}
35

36
//清空线性表
37
Status Clear_Sq(Sqlist &L){
38
    if(!L.elem)return ERROR;
39
    L.length=0;
40
    return OK;
41
}
42

43
//获取元素
44
Status GetElem_sq(Sqlist L,int i,ElemType &e){
45
    if(i<1||i>L.length)return ERROR;
46
    e=L.elem[i-1];
47
    return OK;
48
}
49

50
//插入元素
51
Status Insert_sq(Sqlist &L,int i,ElemType e){
52
    int j;
53
    if(i<1||i>L.length+1)return ERROR;
54
    if(L.length>=L.listsize)return ERROR;
55
    for(j=L.length-1;j>=i-1;j--){
56
        L.elem[j+1]=L.elem[j];
57
    }
58
    L.elem[i-1]=e;
59
    L.length++;
60
    return OK;
61
}
62

63
//删除元素
64
Status Delete_sq(Sqlist &L,int i,ElemType &e){
65
    int j;
66
    if(i<1||i>L.length)return ERROR;
67
    e=L.elem[i-1];
68
    for(j=i-1;j<=L.length-1;j++){
69
        L.elem[j]=L.elem[j+1];
70
    }
71
    L.length--;
72
    return OK;
73
}
74

75
int main(){
76
    int i;
77
    ElemType e;
78
    Sqlist list;
79
    Init_sq(list);
80
    for(i=1;i<=10;i++){
81
        e=rand()%100;
82
        Insert_sq(list,i,e);
83
    }
84
    for(i=1;i<=10;i++){
85
        GetElem_sq(list,i,e);
86
        printf("%d\n",e);
87
    }
88
    for(i=10;i>=1;i--){
89
        Delete_sq(list,i,e);
90
        printf("%d is deleted\n",e);
91
    }
92
    printf("List Length=%d\n",list.length);
93
    return 1;
94
}