weixin_45608039的博客

#include<bits/stdc++.h> using namespace std; const int size=1e4; struct edge { int to; edge *nxt; }; struct ver { int head; edge *firsteg; }; int vis[10000]; class alg { private: ver hd[size]; //邻接表中的数组只有头结点数组，所挂链表所存储的只是

#include<bits/stdc++.h>//链式写法 using namespace std; struct node { int val; node *nxt; }; class linkque { private: node *head,*rear; public: linkque() { node *bt=nullptr; bt=new node; bt->nxt=nullptr; head=rea

#include<bits/stdc++.h> using namespace std; struct node { char val; node *l,*r,*parent; }; class tree { private: node *root; node *pre=nullptr; node * create()// 创建三叉链表 { char ch;//按照前序遍历输入 需要#来标记 cin>>ch;

#include <queue> #include <cstring> #include <algorithm> #include <vector> #include <utility> #include <string> #include <iostream> using namespace std; priority_queue<pair<int, int>, vector<pair<in.