鑫宇的博客

#include <stdio.h>#include <malloc.h>typedef struct SArr{ //数组第一个元素的地址 int *pBase; //数组能存放的最大元素个数 int length; //有效元素的个数 int cnt;} Arr;//初始化数组void init_arr(Arr *, int);//数组末尾追加元素bool append(Arr *, int);//判读数组是.

#include <stdio.h>#include <malloc.h>typedef struct SNode{ int data; struct SNode *next;} * PNode, Node;typedef struct SStack{ PNode pBottom; PNode pTop;} * PStack, Stack;//初始化栈void init(PStack);// 压栈void push(PSt.

#include <stdio.h>#include <malloc.h>//队列长度 只能存放5个元素int length = 6;typedef struct SQueue{ int *Pbase; int front; int rear;} * PQueue, Queue;// 初始化队列void init_queue(PQueue);// 判断队列是否已满bool full_queue(PQueue);// 判断队列是否为.

#include <stdio.h>#include <malloc.h>typedef struct SNode{ // 数据域 int data; // 指针域 struct SNode *next;} * PNode, Node;// PNode=struct SNode* Node=struct SNode// 初始化一个链表PNode init_list();// 插入元素bool insert(PNode, int, int);/

/** * @program: DataSructure * @description: * @author: stone * @create: 2021-09-11 09:29 **/public class SinglyLinkedListDome { public static void main(String[] args) { SinglyLinkedList singlyLinkedList = new SinglyLinkedList();