|
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 |
#include <stdio.h> #include <stdlib.h> typedef int ptrNode; struct Node { int element; ptrNode next; }; #define SIZE ( 10 ) struct Node cursorSpace[SIZE]; ptrNode cursorSpaceInit() { int i; for(i = 0; i < SIZE-1; i++ ) cursorSpace[i].next = i + 1; cursorSpace[i].next = 0; } ptrNode cursorAlloc() { ptrNode p; p = cursorSpace[0].next; cursorSpace[0].next = cursorSpace[p].next; return p; } void cursorFree(ptrNode n) { cursorSpace[n].next = cursorSpace[0].next; cursorSpace[0].next = n; } int isEmpty(ptrNode n) { return cursorSpace[n].next == 0; } int isLast(ptrNode n, ptrNode L) { /*判断第n个数是否为最后一位*/ return cursorSpace[n].next == 0; } ptrNode find(int element, ptrNode L) { ptrNode p; p = cursorSpace[L].next; while(p && cursorSpace[p].element != element) p = cursorSpace[p].next; return p; } ptrNode findPrevious(int x, ptrNode L) { ptrNode p; /*获取查找元素的下标*/ ptrNode target = find(x, L); /*Not found*/ if(target == 0) return -1; p = cursorSpace[L].next; while( p && cursorSpace[p].next != target ) p = cursorSpace[ p ].next; return p; } void delete(int x, ptrNode L) { ptrNode p, tmp; if((p = findPrevious(x, L)) == -1) { printf("Delete %d? element not found .\n", x); return; } if(!isLast( p, L )) { tmp = cursorSpace[p].next; cursorSpace[p].next = cursorSpace[tmp].next; cursorFree(tmp); } } void Error(char *str) { printf("%s\n", str); exit(1); } void printLink(ptrNode L) { ptrNode p =L; printf("List: "); while( ( p = cursorSpace[p].next ) != 0) printf("%d ", cursorSpace[p].element); printf("\n"); } /*x插入到p之后*/ void insert(int x, ptrNode L, ptrNode p) { ptrNode tmp; tmp = cursorAlloc(); if( tmp == 0 ) Error("Out of space"); cursorSpace[ tmp ].element = x; cursorSpace[ tmp ].next = cursorSpace[ p ].next; cursorSpace[ p ].next = tmp; } int main(int argc, char **argv) { ptrNode L; cursorSpaceInit(); /*Header*/ L = cursorAlloc(); /*开始没有元素,头指针指向空(0)*/ cursorSpace[L].next = 0; printf("\nInsert 1, 2, 3, 4\n"); insert(1, L, 1); insert(2, L, 2); insert(3, L, 3); insert(4, L, 4); printLink(L); printf("\nAfter insert 6 into second index of List:\n"); insert(6, L, 2); printLink(L); ptrNode res = findPrevious(5, L); if( res < 0 ) printf("\nNot found element 5\n\n"); else printf("\nfindPrevious(5, L) return index: %d\n\n", res); printf("isEmpty(L): %d\n", isEmpty(L)); printf("isLast(4, L): %d\n\n", isLast(4, L)); delete(5, L); printf("After delete(5, L), find(5, L): %d\n", find(5, L)); printf("\nfind(2, L) return index: %d\n\n", find(2, L)); printf("After delete element: 2\n"); delete(2, L); printf("find(2, L): %d\n", find(2, L)); printLink(L); return 0; } |