链表的基本操作

最新推荐文章于 2022-08-29 14:49:54 发布

原创最新推荐文章于 2022-08-29 14:49:54 发布 · 301 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#面试题

c/c++ 语言面试专栏收录该内容

18 篇文章

订阅专栏

本文介绍了一个简单的链表实现，包括创建、打印、插入、删除及清空链表等基本操作。通过具体的C语言代码示例，帮助读者理解链表的工作原理及如何进行常见操作。

#include<stdio.h>
#include<malloc.h>
typedef struct List
{
   int data;
   List * next;
}list;

list * createlist()
{
   list * Head = (list*)malloc(sizeof(list));

   list * cur= Head; //保存尾节点
   cur->next = NULL;
   int data;
   while(1)
   {
       scanf_s("%d", &data);
       if (data < 0)
       {
           break;
       }
       else
       {
           list * pnew = (list*)malloc(sizeof(list));
           cur->next = pnew;
           pnew->next = NULL;
           pnew->data = data;
           cur = pnew; //保存尾节点
       }

   }
   return Head;
}
void PrintfList(list *Head)
{
   if (Head == NULL)
   {
       return;
   }
   list * L = Head->next;
   while (L != NULL)
   {
       printf("%d\n", L->data);
       L = L->next;
   }

}
void InsertList(list*Head, int x, int y)
{
   if (Head == NULL)
   {
       return;
   }
   list *pre = Head;
   list *cur = Head->next;

   while (cur != NULL)
   {
       if (cur->data == x)
       {
           break;
       }
       pre = pre->next;
       cur = cur->next;
   }

   list * pnew = (list*)malloc(sizeof(list));
   pnew->data = y;
   pre->next = pnew;
   pnew->next = cur;
}
void DeleteList(list* Head,int x)
{
   if (Head == NULL)
   {
       return;
   }
   list *pre = Head;
   list *cur = Head->next;
   int flag = 0; //没有找到
   while (cur != NULL)
   {
       if (cur->data == x)
       {
           pre->next = cur->next;
           free(cur);
            flag = 1;
           break;
       }
       pre = pre->next;
       cur = cur->next;
   }
   if (flag == 0)
   {
       printf("not find the vlaue %d\n", x);
   }

}
void ClearList(list *Head)
{
   while (Head == NULL)
   {
       return;
   }
   list *del = Head;
   while (del != NULL)
   {
       Head = Head->next;
       free(del);
       del = Head;
   }
}
void main()
{
   list * Head = createlist();
   PrintfList(Head);
   InsertList(Head,5,4);
   PrintfList(Head);
   DeleteList(Head, 4);
   PrintfList(Head);
   ClearList(Head);
   PrintfList(Head);
}

面试题目：

写出一个函数，在链表的pHead头结点之后，插入一个新的结点。

void insert（List *pHead, List * new）

{

pHead->next = new;

new->next = pHead->next;

}