m0_48711099的博客

#include <iostream> #include <algorithm> #include <vector> #include <string.h> #include <queue> #include <climits> using namespace std; const int MAXN=200; //顶点数 const int INF=INT_MAX; struct Edge{ //边的结构

#include <iostream> #include <queue> using namespace std; int main() { int n; while (scanf("%d",&n)!=EOF){ priority_queue<int,vector<int>,greater<int>> MypriorityQueue; //每次取出最小的两个值，小顶堆，优先级低的先输出

#include <iostream> #include <queue> using namespace std; struct Complex{ int real,imag; Complex(int a,int b):real(a),imag(b){} //构造函数 bool operator <(Complex c) const{ //重载小于号 if(real*real+imag*imag==c.real*c.rea

input: 1+2 4+2*5-7/11 0 output: 3.00 13.36 #include <iostream> #include <cctype> #include <stack> using namespace std; int Priority(char c){ if(c=='#') return 0; else if(c=='$') return 1; else if(c=='+'||c=='-')return 2; e

#include <iostream> #include <stack> using namespace std; int main() { string s; while(cin>>s){ string ans(s.size(),' '); stack<int> brackets; for(int i=0;i<s.size();i++){ if(s[i]=='('

n个小孩按1-n次序围成一圈，从编号为p的小孩开始报数，由1报到m，报到m时这名小孩从圈中出去，然后下一名小孩再从1开始报，报到m时再出去。直到所有小孩出去，输出先后出去的小孩的编号 #include <iostream> #include <queue> using namespace std; int main() { int n,p,m; while (scanf("%d%d%d",&n,&p,&m)){ //n个小孩从编号p

typedef struct { int val; struct MyLinkedList* next; } MyLinkedList; MyLinkedList* myLinkedListCreate() { //这个题必须用虚拟头指针,参数都是一级指针,头节点确定后没法改指向了!!! MyLinkedList*head=(MyLinkedList*)malloc(sizeof(MyLinkedList)); head->next=NULL; ret

#include<iostream> using namespace std; int f(int n, int m){ return n == 1 ? n : (f(n - 1, m) + m - 1) % n + 1; } int main(){ int n,m; cin>>n>>m; cout<<f(n,m); system("pause"); return 0; }

#include <iostream> #include <algorithm> #include <vector> #include <map> using namespace std; vector<int> post, in; map<int, int> level; void pre(int root,int start,int end,int index){ //root子树根结点在后序中位置,start和end分别为子

#include <iostream> #include <algorithm> #include <vector> using namespace std; struct node { int id, l, r, index, level; } a[100]; vector<node> v1; bool cmp(node a,node b){ if(a.level!=b.level) return a.level<b.level;

#include <iostream> using namespace std; struct node{ int val; struct node*left,*right; }; node* rotateleft(node* root){ node*t=root->right; root->right = t->left; t->left=root; return t; } node* rotateright(node*

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} *

#include <stdio.h> #include <stdlib.h> #include<stack> #include<queue> #include<iostream> using namespace std; typedef char BiElemType; typedef struct BiTNode { //二叉树结构 BiElemType c;

#include <stdio.h> #include <stdlib.h> #include<stack> #include<queue> #include<iostream> #include <math.h> using namespace std; typedef char ElemType; typedef struct ThreadNode { //线索树结构 ElemType dat

//队列的相关数据结构 typedef struct LinkNode{ ElemType data; struct LinkNode *next; }LinkNode; typedef struct{ LinkNode *front,*rear; }LinkQueue; void InitQueue(LinkQueue &Q) { Q.front=Q.rear=(LinkNode*)malloc(sizeof(LinkNode)); Q.front->next=NULL; }

//栈的相关数据结构 #define MaxSize 50 typedef BiTree ElemType; typedef struct{ ElemType data[MaxSize]; int top; }SqStack; void InitStack(SqStack &S) { S.top=-1; } bool StackEmpty(SqStack &S) { if(S.top==-1) return true; else return false; } //入栈