【无标题】

最新推荐文章于 2024-11-09 12:42:49 发布

锅挤

最新推荐文章于 2024-11-09 12:42:49 发布

阅读量1.3k

点赞数 37

文章标签： c语言

本文链接：https://blog.csdn.net/gz040725/article/details/137476203

版权

本文介绍了如何使用C语言实现一个静态链表，包括链表的初始化、插入元素（如H,e,l,l,o）以及删除特定字符的功能，并通过单元测试展示了整个过程。

摘要由CSDN通过智能技术生成

#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空间
   ListPtr tempPtr = (ListPtr)malloc(sizeof(struct StaticLinkedList));

   //开辟ListPtr中NodePtr和used的空间
   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;

   // Only the first node is used.
   tempPtr->used[0] = 1;
   int i;
   for (i = 1; i < DEFAULT_SIZE; i++){
       tempPtr->used[i] = 0;
   }
   return tempPtr;
}

/***
print the list
***/
void printList(ListPtr paraListPtr){
   int p = 0;
   while (p != -1) {
       printf("%c", paraListPtr->nodes[p].data);
       p = paraListPtr->nodes[p].next;
   }
   printf("\r\n");
}

/***
insert an element
***/
void insertElement(ListPtr paraListPtr, char paraChar, int paraPosition){
   int p, q, i;

   //step 1 :Search to the position.
   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;
       }
   }

   //step 2:Construct a new node
   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;

   //step 3: now link
   printf("linking\r\n");
   paraListPtr->nodes[q].next = paraListPtr->nodes[p].next;
   paraListPtr->nodes[p].next = q;
}

/***
delete an element
***/
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;
}

/***
unit test
***/
void appendInsertDeleteTest(){
   // Step 1:initialize an empty list.
   ListPtr tempList = initLinkedList();
   printList(tempList);

   // Step 2:add some characters.
   insertElement(tempList, 'H', 0);
   insertElement(tempList, 'e', 1);
   insertElement(tempList, 'l', 2);
   insertElement(tempList, 'l', 3);
   insertElement(tempList, 'o', 4);
   printList(tempList);

   // Step 3:delete some characters
   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);
}

int main(){
appendInsertDeleteTest();
return 0;
}