带头结点的链表实现（C语言）

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef int Status; // Status 是函数返回值类型，其值是函数结果状态代码。

typedef int ElemType; // ElemType 为可定义的数据类型，此设为int类型

#define MAXSIZE 100 // 链表可能达到的最大长度

typedef struct LNode
{
   ElemType data;      // 结点的数据域
   struct LNode *next; // 结点的指针域
} LNode, *LinkList;    // LinkList为指向结构体LNode的指针类型

Status InitList(LinkList *L) // 算法2.6 单链表的初始化
{
   // 构造一个空的单链表L
   *L = (LNode *)malloc(sizeof(LNode)); // 生成新结点作为头结点，用头指针L指向头结点
   (*L)->next = NULL;                   // 头结点的指针域置空
   return OK;
}

Status DestroyList(LinkList *L)
{
   /* 初始条件：线性表L已存在。操作结果：销毁线性表L */
   LinkList q;
   while (*L)
   {
      q = (*L)->next;
      free(*L);
      *L = q;
   }
   return OK;
}

int ListLength(LinkList L)
{
   int len = 0;
   while ((L = L->next) != NULL)
      len++;
   return len;
}

int ListEmpty(LinkList L)
{
   int len = 0;
   while ((L = L->next) != NULL)
      len++;
   return !len;
}

Status ListInsert(LinkList *L, int i, ElemType e) // 算法2.9 单链表的插入
{
   if (i < 1 || i > ListLength(*L) + 1)
      return ERROR;
   LNode *mid = *L;
   for (int j = 0; j < i - 1; j++)
      mid = mid->next; // 定位到前一个位置
   LNode *p = (LNode *)malloc(sizeof(LNode));
   p->data = e;
   p->next = mid->next;
   mid->next = p;
   return OK;
   /***********************************/
} // ListInsert
Status GetElem(LinkList L, int i, ElemType *e) // 算法2.7 单链表的取值
{
   if (i < 1 || i > ListLength(L))
      return ERROR;
   for (int j = 0; j < i; j++)
      L = L->next;
   *e = L->data;
   return OK;
} // GetElem

int LocateElem(LinkList L, int e) // 略有改动 算法2.8 按值查找
{
   int i = 0;

   while ((L = L->next) != NULL)
   {
      ++i;
      if (L->data == e)
         return i;
   }
   return ERROR;
} // LocateElem

Status ListDelete(LinkList *L, int i) // 算法2.9 单链表的删除
{
   LNode *pre = *L, *p = (*L)->next;
   if (i < 1 || i > ListLength(*L))
   {
      return ERROR;
   }
   for (int j = 0; j < i - 1; j++)
   {
      pre = pre->next;
      p = p->next;
   }
   pre->next = p->next;
   free(p);
   return OK;
} // ListDelete

void ListPrint(LinkList L)
{
   LNode *p = L;
   for (p = L->next; p; p = p->next)
   {
      printf("%d", p->data);
      if (p->next)
         putchar(' ');
      else
         putchar('\n');
   }
}

int main()
{
   int i;
   ElemType e;
   LinkList L;
   char op[100];
   InitList(&L);
   while (scanf("%s", op) != EOF)
   {
      if (strcmp(op, "Empty") == 0)
         if (ListEmpty(L))
            printf("Empty\n");
         else
            printf("Not empty\n");
      else if (strcmp(op, "Insert") == 0)
      {
         scanf("%d%d", &i, &e);
         if (ListInsert(&L, i, e) == ERROR)
            printf("Insert failed\n");
         else
            ListPrint(L);
      }
      else if (strcmp(op, "Length") == 0)
      {
         printf("List length is %d\n", ListLength(L));
      }
      else if (strcmp(op, "GetElem") == 0)
      {
         scanf("%d", &i);
         if (GetElem(L, i, &e) == ERROR)
            printf("Out of index\n");
         else
            printf("The elem at position %d is %d\n", i, e);
      }
      else if (strcmp(op, "LocateElem") == 0)
      {
         scanf("%d", &e);
         i = LocateElem(L, e);
         if (i == 0)
            printf("%d is not found in list\n", e);
         else
            printf("%d is found at the position %d\n", e, i);
      }
      else if (strcmp(op, "Delete") == 0)
      {
         scanf("%d", &i);
         if (ListDelete(&L, i) == ERROR)
            printf("Delete failed\n");
         else
            ListPrint(L);
      }
   }
   DestroyList(&L);
   return 0;
}

数据结构 单链表基本操作（C++）https://blog.csdn.net/Ruannn/article/details/129644250?spm=1001.2014.3001.5502不带头结点的链表实现(C++)https://blog.csdn.net/Ruannn/article/details/129653016?spm=1001.2014.3001.5502