weixin_41391865的博客

Git链接：https://github.com/gy5461/DremmaEnginev0.1已发布

#pragma warning(disable:4996)#include<cstdlib>#include<cstdio>#include<cstring>#define MAX_VERTEX_NUM 20#define TRUE 1#define FALSE 0#define ERROR -1 /*出错*/#define OK 1i...

#pragma warning(disable:4996)#include<cstdlib>#include<cstdio>#include<cstring>#define MAX_VERTEX_NUM 20#define TRUE 1#define FALSE 0#define ERROR -1 /*出错*/#define OK 1i...

宏观来看，使用unique函数去重主要分为以下几步：以vector为例：声明部分：#include<vector>#include<algorithm>vector<int>v;vector<int>::iterator new_end;三个主要步骤：sort(v.begin(),v.end());//第一步：排序（从小...

因为ASCII码只有256个，故可以这样做：#pragma warning(disable:4996)#include<cstdio>#include<cstdlib>#include<cstring>char str[200];int cnt[256];void CountChar(char* str) { //统计每个字符出现的个数并打印...

#pragma warning(disable:4996)#include<cstdio>#include<cstdlib>typedef struct BiTNode { char data; struct BiTNode *lchild, *rchild;//左右孩子指针}BiTNode,*BiTree;bool CreateBiTree(BiTree ...

#pragma warning(disable:4996)；#include<cstdio>#include<cstdlib>int MAXQSIZE = 5;typedef struct { int *base; int front;//队列开始 int rear;//队列结束的下一个位置}SqQueue;bool InitQueue(SqQueue...

#include<stdio.h>#include<stdlib.h>typedef struct LNode { int data; struct LNode *next;}LNode,*LinkList;void CreatList_L(LinkList &L, int n) { //逆位序输入n个元素的值，建立带表头结点的单链线性表L. L ...

#include<cstdio>#include<cstdlib>#include<iostream>#include<algorithm>using namespace std;//定义顺序表初始容量和扩容容量#define LIST_INIT_SIZE 100#define LISTINCREMENT 10typedef str...

#include<cstdio>#include<cstdlib>#include<cstring>typedef struct Snode { char data; struct Snode *next;}Snode, *LinkStack;int InitStack(LinkStack &S) { //创建一个空链栈 S = N...

#pragma warning(disable:4996)#include<cstring>#include<cstdio>#include<cstdlib>#define STACK_INIT_SIZE 100#define STACKINCREMENT 10//顺序栈typedef struct { char *base; char *t...

#include<cstdio>#include<cstdlib>typedef struct dLNode{ int data; struct dLNode* prior; struct dLNode* next;}dLNode,*dLinkList;void CreatList(dLinkList &L,int n) { L = (dLinkL...