C++ Code
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 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 |
#include<stdio.h>
#include<stdlib.h> #define OK 1 #define ERROR 0 #define MAXSIZE 20 typedef struct { int data[MAXSIZE]; //数组,存储线性表数据 int length; //线性表长度 }SqList; /*初始化线性表*/ int InitList(SqList *L) { L->length = 0; return OK; } /*判断线性表是否为空,为空返回OK,否则返回ERROR*/ int ListEmpty(SqList L) { if (L.length == 0) return OK; else return ERROR; } /*清除线性表*/ int ClearList(SqList *L) { L->length = 0; return OK; } /*返回线性表长度*/ int ListLength(SqList L) { return L.length; } /*返回L中第i个数据元素的值*/ int GetElemt(SqList L, int i, int *e) { if (L.length == 0 || i < 0 || i > L.length) return ERROR; else *e = L.data[i - 1]; return OK; } /*返回线性表中第1个与e满足关系的位置*/ int LocateElem(SqList L, int e) { int i; if (L.length == 0) return ERROR; for (i = 0; i < L.length; i++) { if (L.data[i] == e) break; } if (i >= L.length) return ERROR; return i + 1; } /*在线性表L的第i个位置插入新的数据元素e*/ int ListInsert(SqList *L, int i, int e) { int k; if (L->length == MAXSIZE) return ERROR; if (i< 1 || i>L->length + 1) return ERROR; if (i <= L->length) { for (k = L->length ; k >= i; k--) { L->data[k] = L->data[k- 1]; } } L->data[i- 1] = e; L->length++; return OK; } /*删除线性表L的第i个元素*/ int ListDelet(SqList *L, int i, int *e) { int k; if (L->length == 0) return ERROR; if (i < 1 || i > L->length) return ERROR; *e = L->data[i - 1]; if (i < L->length) { for (k = i; k < L->length; k++) L->data[k- 1] = L->data[k]; } L->length--; return OK; } /*依次输出线性表L中的元素*/ int ListTravse(SqList L) { int i; for (i = 1; i <=L.length; i++) printf( "%d", L.data[i- 1]); printf( "\n"); return OK; } void unionL(SqList *La, SqList Lb) { int La_len, Lb_len,i; int e; La_len = ListLength(*La); Lb_len = ListLength(Lb); for (i = 1; i <= Lb_len; i++) { GetElemt(Lb, i, &e); if (!LocateElem(*La, e)) ListInsert(La, ++La_len, e); } } int main() { SqList L; SqList Lb; int e; int i; int j, k; i = InitList(&L); printf( "初始化线性表L后长度为:%d\n", L.length); for (i = 1; i <= 5; i++) j = ListInsert(&L, 1, i); ListTravse(L); printf( "线性表L后长度为:%d\n", L.length); i = ListEmpty(L); printf( "L是否为空:i=%d(0为非空,1为空\n", i); i = ClearList(&L); printf( "L是否为空:i=%d(0为非空,1为空\n", i); for (j = 1; j <= 10; j++) { i = ListInsert(&L, j, j); } printf( "在L末尾依次插入1到10后,L.data=\n"); ListTravse(L); printf( "L.length = %d\n", L.length); ListInsert(&L, 1, 0); printf( "在L表头插入0后L.data为\n"); ListTravse(L); GetElemt(L, 5, &e); printf( "第5个数据为%d\n",e); for (j = 3; j <= 4; j++) { k = LocateElem(L, j); if (k) printf( "第%d个元素为%d\n", k, j); else printf( "线性表中没有%d这个元素\n", j); } j = 5; k = ListDelet(&L, j, &e); if (k = ERROR) printf( "删除第j个元素失败"); else printf( "删除的第%d个元素为%d\n",j, e); printf( "依次输出L的元素\n"); ListTravse(L); i = InitList(&Lb); for (j = 6; j <= 15; j++) i = ListInsert(&Lb, 1, j); ListTravse(Lb); unionL(&L, Lb); printf( "合并了Lb的L元素\n"); ListTravse(L); return 0; } |