比特106-数据结构-链表

墨泽Y

已于 2024-07-23 12:03:48 修改

阅读量887

点赞数 22

文章标签：数据结构链表算法

于 2024-03-13 13:40:04 首次发布

本文链接：https://blog.csdn.net/qq_26117157/article/details/136677650

版权

SList.h

#include <stdio.h>
typedef int SListDataType;

typedef struct SListNode
{
SListDataType data;
struct SListNode* next;
}SListNode;

void SlistPushBack(SListNode** pphead, SListDataType x);
void SlistPopBack(SListNode** pphead);
void SlistPushFront(SListNode** phead, SListDataType x);
void SlistPopFront(SListNode** pphead);
SListNode* SListFind(SListNode* phead, SListDataType x);
void SListInsertAfter(SListNode* pos, SListDataType x);
void SListPrint(SListNode* phead);

SList.c

#pragma once
#include"SList.h"
#include<stdlib.h>
#include<assert.h>

SListNode* BuySListNode(SListDataType x)
{
   SListNode* newNode = (SListNode*)malloc(sizeof(SListDataType));
   if (newNode == NULL)
   {
       printf("申请节点失败！\n");
       exit(-1);
   }

newNode->data = x;
newNode->next = NULL;

return newNode;
}

void SListPrint(SListNode* phead)
{
   SListNode* cur = phead;
   while (cur != NULL)
   {
       printf("%d", cur->data);
       cur = cur->next;
   }
}

void SlistPushBack(SListNode** pphead, SListDataType x)
{
SListNode* newNode = BuySListNode(x);

   if(*pphead==NULL)
   {
       *pphead = newNode;
   }
   else
   {
       SListNode* tail = *pphead;
       while (tail->next != NULL)
       {
           tail = tail->next;
       }

tail->next = newNode;

}
}

void SListPopBack(SListNode** pphead)
{
   if (*pphead == NULL)
   {
       return;
   }
   else if ((*pphead)->next == NULL)
   {
       free(* pphead);
       *pphead = NULL;
   }
   else
   {
       SListNode* prev = NULL;
       SListNode* tail = *pphead;
       while (tail->next != NULL)
       {
           prev = tail;
           tail = tail->next;
       }
       free(tail);
       //tail=NULL;
       prev->next = NULL;
   }
}

void SlistPushFront(SListNode** pphead, SListDataType x)
{
   SListNode* newnode = BuySListNode(x);
   newnode->next = *pphead;
   *pphead = newnode;
}

void SlistPopFront(SListNode** pphead)
{
   if(*pphead=NULL)
   {
       return;
   }
   else
   {
       SListNode* next = (*pphead)->next;
       free(*pphead);
       *pphead = (*pphead)->next;
   }
}

SListNode* SListFind(SListNode* phead, SListDataType x)
{
   SListNode* cur = phead;
   while (cur)
   {
       if (cur->data == x)
       {
           return cur;
       }
       cur = cur->next;
   }
   return NULL;
}

void SListInsertAfter(SListNode* pos, SListDataType x)
{
   assert(pos);
   SListNode* newnode = BuySListNode(x);
   newnode->next=pos->next;
   pos->next = newnode;
}

test.c

#define _CRT_SECURE_NO_WARNINGS
#include "SList.h"

int main()
{
SListNode* pList = NULL;

   SlistPushBack(&pList, 1);
   SlistPushBack(&pList, 2);
   SlistPushBack(&pList, 3);
   SlistPushBack(&pList, 4);

SListPrint(pList);
return 0;
}