数据结构 C 代码 4 静态链表
静态链表的定义
- 静态链表是线性连续结构,储存的数据是固定的,增删时不需要挪动其它的数据。
老师代码
#include <stdio.h>
#include <malloc.h>
#define DEFAULT_SIZE 5
typedef struct StaticLinkedNode{
char data;
int next;
} *NodePtr;
typedef struct StaticLinkedList{
NodePtr nodes;
int* used;
} *ListPtr;
ListPtr initLinkedList(){
ListPtr tempPtr = (ListPtr)malloc(sizeof(StaticLinkedList));
tempPtr->nodes = (NodePtr)malloc(sizeof(struct StaticLinkedNode) * DEFAULT_SIZE);
tempPtr->used = (int*)malloc(sizeof(int) * DEFAULT_SIZE);
tempPtr->nodes[0].data = '\0';
tempPtr->nodes[0].next = -1;
tempPtr->used[0] = 1;
for (int i = 1; i < DEFAULT_SIZE; i ++){
tempPtr->used[i] = 0;
}
return tempPtr;
}
void printList(ListPtr paraListPtr){
int p = 0;
while (p != -1) {
printf("%c", paraListPtr->nodes[p].data);
p = paraListPtr->nodes[p].next;
}
printf("\r\n");
}
void insertElement(ListPtr paraListPtr, char paraChar, int paraPosition){
int p, q, i;
p = 0;
for (i = 0; i < paraPosition; i ++) {
p = paraListPtr->nodes[p].next;
if (p == -1) {
printf("The position %d is beyond the scope of the list.\r\n", paraPosition);
return;
}
}
for (i = 1; i < DEFAULT_SIZE; i ++){
if (paraListPtr->used[i] == 0){
printf("Space at %d allocated.\r\n", i);
paraListPtr->used[i] = 1;
q = i;
break;
}
}
if (i == DEFAULT_SIZE){
printf("No space.\r\n");
return;
}
paraListPtr->nodes[q].data = paraChar;
printf("linking\r\n");
paraListPtr->nodes[q].next = paraListPtr->nodes[p].next;
paraListPtr->nodes[p].next = q;
}
void deleteElement(ListPtr paraListPtr, char paraChar){
int p, q;
p = 0;
while ((paraListPtr->nodes[p].next != -1) && (paraListPtr->nodes[paraListPtr->nodes[p].next].data != paraChar)){
p = paraListPtr->nodes[p].next;
}
if (paraListPtr->nodes[p].next == -1) {
printf("Cannot delete %c\r\n", paraChar);
return;
}
q = paraListPtr->nodes[p].next;
paraListPtr->nodes[p].next = paraListPtr->nodes[paraListPtr->nodes[p].next].next;
paraListPtr->used[q] = 0;
}
void appendInsertDeleteTest(){
ListPtr tempList = initLinkedList();
printList(tempList);
insertElement(tempList, 'H', 0);
insertElement(tempList, 'e', 1);
insertElement(tempList, 'l', 2);
insertElement(tempList, 'l', 3);
insertElement(tempList, 'o', 4);
printList(tempList);
printf("Deleting 'e'.\r\n");
deleteElement(tempList, 'e');
printf("Deleting 'a'.\r\n");
deleteElement(tempList, 'a');
printf("Deleting 'o'.\r\n");
deleteElement(tempList, 'o');
printList(tempList);
insertElement(tempList, 'x', 1);
printList(tempList);
}
void main(){
appendInsertDeleteTest();
}
我的代码
#include <stdio.h>
#include <malloc.h>
#define DEFAULT_SIZE 5
typedef struct StaticLinkedNode{
char data;
int next;
} *NodePtr;
typedef struct StaticLinkedList{
NodePtr nodes;
int* used;
} *ListPtr;
ListPtr initLinkedList(){
ListPtr tempPtr = (ListPtr)malloc(sizeof(StaticLinkedList));
tempPtr->nodes = (NodePtr)malloc(sizeof(struct StaticLinkedNode) * DEFAULT_SIZE);
tempPtr->used = (int*)malloc(sizeof(int) * DEFAULT_SIZE);
tempPtr->nodes[0].data = '\0';
tempPtr->nodes[0].next = -1;
tempPtr->used[0] = 1;
for (int i = 1; i < DEFAULT_SIZE; i++){
tempPtr->used[i] = 0;
}
return tempPtr;
}
void printList(ListPtr paraListPtr){
int p = paraListPtr->nodes[0].next;
if(p == -1){
printf("the list is empty\n");
return;
}
while(p != -1){
printf("%c", paraListPtr->nodes[p].data);
p = paraListPtr->nodes[p].next;
}
printf("\r\n");
}
void insertElement(ListPtr paraListPtr, char paraChar, int paraPosition){
int p, q, i;
p = 0;
for(i = 0; i < paraPosition; i++){
p = paraListPtr->nodes[p].next;
if(p == -1){
printf("The position %d is beyond the scope of the list.\n", paraPosition);
return;
}
}
for(i = 1; i < DEFAULT_SIZE; i++){
if(paraListPtr->used[i] == 0){
printf("Space at %d allocated.", i);
paraListPtr->used[i] = 1;
q = i;
break;
}
}
if(i == DEFAULT_SIZE){
printf("No space.\n");
return;
}
paraListPtr->nodes[q].data = paraChar;
paraListPtr->nodes[q].next = paraListPtr->nodes[p].next;
paraListPtr->nodes[p].next = q;
printf("linking\r\n");
}
void insertElementTest(){
printf("--- The insertElementTest Begin ---\n");
ListPtr tempList = initLinkedList();
printList(tempList);
insertElement(tempList, 'A', 0);
insertElement(tempList, 'B', 1);
insertElement(tempList, 'C', 2);
printList(tempList);
insertElement(tempList, '0', 6);
insertElement(tempList, 'D', 2);
insertElement(tempList, '5', 0);
printList(tempList);
printf("--- The insertElementTest End ---\n");
}
void deleteElement(ListPtr paraListPtr, char paraChar){
int p, q;
p = 0;
while((paraListPtr->nodes[p].next != -1) && (paraListPtr->nodes[paraListPtr->nodes[p].next].data != paraChar)){
p = paraListPtr->nodes[p].next;
}
if(paraListPtr->nodes[p].next == -1) {
printf("Cannot delete the %c\r\n", paraChar);
return;
}
q = paraListPtr->nodes[p].next;
paraListPtr->nodes[p].next = paraListPtr->nodes[q].next;
paraListPtr->used[q] = 0;
}
void deleteTest(){
printf("--- The deleteTest Begin ---\n");
ListPtr tempList = initLinkedList();
printList(tempList);
insertElement(tempList, 'A', 0);
insertElement(tempList, 'B', 1);
insertElement(tempList, 'C', 2);
insertElement(tempList, 'D', 3);
printList(tempList);
printf("Deleting 'A'.\r\n");
deleteElement(tempList, 'A');
printList(tempList);
printf("Deleting 'C'.\r\n");
deleteElement(tempList, 'C');
printList(tempList);
printf("Deleting 'D'.\r\n");
deleteElement(tempList, 'D');
printList(tempList);
printf("header.next = %d\n", tempList->nodes[0].next);
insertElement(tempList, 'X', 1);
printList(tempList);
printf("--- The deleteTest End ---\n");
}
int locateElement(ListPtr paraList, char paraData){
int p;
p = 0;
while(paraList->nodes[p].data != paraData && p != -1){
p = paraList->nodes[p].next;
}
if(p == -1){
printf("Don't have the data.\n");
}
return p;
}
void locateElementTest(){
printf("--- The locateElementTest Begin ---\n");
int temp;
ListPtr tempList = initLinkedList();
printList(tempList);
insertElement(tempList, 'A', 0);
insertElement(tempList, 'B', 1);
insertElement(tempList, 'C', 2);
insertElement(tempList, 'D', 3);
printList(tempList);
temp = locateElement(tempList, 'A');
printf("%c\n", tempList->nodes[temp].data);
temp = locateElement(tempList, 'B');
printf("%c\n", tempList->nodes[temp].data);
printf("%c\n", tempList->nodes[tempList->nodes[temp].next].data);
printf("--- The locateElementTest End ---\n");
}
int main(){
locateElementTest();
insertElementTest();
deleteTest();
return 0;
}