H_Strong的博客

#pragma once#include<stdio.h>#include<stdlib.h>#include<assert.h>#include<stdlib.h>#define MAX 100typedef char DataType;typedef s

链式队列头文件#pragma once#include<stdio.h>#include<assert.h>#include<stdlib.h>#define _CRT_SECURE_NO_WARNINGS 1typedef int QDataType;typedef struct LinkList{ struct LinkLis *n...

头文件//Stack.h#include<stdio.h>#include<stdlib.h>#include<assert.h>#include<stdlib.h>#include"Maze.h"#define MAX 100typedef struct Position Da

头文件#pragma once#include <stdio.h>#include <string.h>#include <assert.h>#include <stdlib.h>#define ROW 6 #define COL 6typedef struct Maze{ int _map[ROW][

二叉树所需要的头文件//binarytree.h#ifndef __binarytree_h__#define __binarytree_h__#define _CRT_SECURE_NO_WARNINGS 1#include<stdio.h>#include<stdlib.h>#include<assert.h>#include"Queue...

单链表头文件//SList#pragma once#include <stdio.h>#include <stdlib.h>#include <assert.h>#define _CRT_SECURE_NO_WARNINGS 1typedef int DataType;typedef struct SListNode{ Dat...

##什么是复杂链表？展示一下复杂链表的结构体样式。typedef struct ComplexNode{ struct ComplexNode *next; struct ComplexNode *random; //指向一个随机值 int data;}ComplexNode;复杂链表就是一个带着random指针的单链表。由于random指向的不确定性。让复杂链表的操作存在一定的...