qq_43362331的博客

#include<iostream>#include<vector>using namespace std;template<class K, class V>struct AVLTreeNode { AVLTreeNode(const pair<K, V>& kv) :_pLeft(nullptr), _pRight(nullptr), _pParent(nullptr), _kv(kv), _bf(0) {}; AVLTreeNode

namespace wh { template<class T, class Container> class stack { public: void push(const T& x) { _con.push_back(x); } void pop() { _con.pop_back(); } int size() { return _con.size(); } T& top() { return _con.bac

//Stack.h#pragma once#include<stdio.h>#include<assert.h>#include<stdlib.h>typedef int STDataType;typedef struct Stack{ STDataType* _a; int _top; // 栈顶 int _capacity; // 容量 }Stack;// 初始化栈 void StackInit(Stack* ps);// 入栈 v

//SeqList.h#pragma once#include<stdio.h>#include<assert.h>#include<malloc.h>typedef int ElemType;typedef struct SeqList { ElemType* data; int size; // 有效数据的个数 int capacity; // 数组的容量}SeqList;void SeqListInit(SeqList* ps

c语言操作符详解c语言操作符算术操作符移位操作符位操作符赋值操作符单目操作符关系操作符逻辑操作符逗号表达式 算术操作符          +  - * / % 1. /操作符 如果左右两边为整数，则输出也为整数，如果要输出浮点数，那么左右两边要有一个为浮点数2.%操作符的两边必须要为整数移位操作符 <<   左移操作符>> ...

//Queue.h#pragma once#include<stdio.h>#include<malloc.h>#include<assert.h>typedef int QDataType;typedef struct QListNode{ QDataType _data; struct QListNode* _next;}QNode;// 队列的结构 typedef struct Queue{ QNode* _front; QNod

//Heap.h#pragma once#include <stdio.h>#include<assert.h>typedef int HpDataType;typedef struct Heap{ HpDataType* _a; size_t _size; size_t _capacity;}Heap;void InitHeap(Heap* hp);// 堆的构建Heap* HeapCreate(HpDataType* a, siz

//LinkList.h 单向不带头非循环#pragma once#include<stdio.h>#include<malloc.h>#include<assert.h>typedef int ElementType;typedef struct LinkList { ElementType e; struct LinkList* next;}LinkList;/*初始化链表*/void InitLinkList(LinkList** LL

namespace wh { template<class T, class Container = vector<T>, class compare = wh::less<T>> class priority_queue { public: void push(const T& x) { _con.push_back(x); AdjustUp(_con.size() - 1); } void pop() { swap(_co

//BinaryTree.h#pragma once#include<stdio.h>#include<malloc.h>typedef char BTDataType;typedef struct BinaryTreeNode{ BTDataType _data; struct BinaryTreeNode* _left; struct BinaryTreeNode* _right;}BTNode;#include"Queue.h"// 通过前序遍

#define _CRT_SECURE_NO_WARNINGS 0#include<iostream>#include<cstring>using namespace std;namespace test { class string { public: typedef char* iterator; /*输入输出重载*/ friend ostream& operator<<(ostream& _cout, const test

namespace wh{ template<class T> class vector { public: typedef T* iterator; typedef T* const_iterator; vector() : _start(0), _finish(0), _endofstorage(0) {}//缺省参数构造函数 vector(const vector<T>& v) : _start(0), _finish(0), _endofstor

写一个简单的程序实现扫雷游戏首先先创建头文件定义常量，以及引入的库文件#define _CRT_SECURE_NO_WARNINGS 1 ...

namespace wh { template<class T> struct _list_node { _list_node<T>* _prev; _list_node<T>* _next; T _data; _list_node(const T& x = T()) :_data(x), _prev(nullptr), _next(nullptr) {} }; template<class T, class Ref, class