yyer

分类

/ 注册

全部文章（共24篇）

题解 | #查找第K小数#

#include <iostream> #include <set> using namespace std; int main() { int n,k; while(cin>>n){ int a; set<...

2023-02-12

1 300

题解 | #哈夫曼树#

#include <queue> #include <iostream> using namespace std; int main() { int val,n,sum; while(scanf("%d",&n)!=EOF){ sum=0; ...

2023-02-12

1 338

题解 | #复数集合#

//当涉及到多次删除等操作，还是要用队列或栈之类，而不是用vector //若对输出有自定义优先级要求，则用优先队列 #include <queue> #include <string> #include <iostream> using namespace st...

2023-02-12

3 410

题解 | #二叉排序树#

#include <iostream> using namespace std; struct TreeNode{ int data; TreeNode* left; TreeNode* right; }; TreeNode* build(TreeNode* ro...

2023-02-10

3 412

题解 | #二叉排序树#

#include <iostream> using namespace std; struct TreeNode{ int data; TreeNode* leftChild; TreeNode* rightChild; }; TreeNode* func(Tre...

2023-02-10

1 328

题解 | #二叉树遍历#

#include <iostream> #include <string> using namespace std; struct TreeNode{ char data; TreeNode* leftChild; TreeNode* rightChi...

2023-02-09

2 317

题解 | #二叉树遍历#

//二叉树的建立和二叉树的中序遍历 #include <iostream> using namespace std; struct TreeNode{ char c; TreeNode* leftChild; TreeNode* rightChild; }; Tr...

2023-02-05

1 319

题解 | #吃糖果#

#include <iostream> using namespace std; const int maxn=21; long long f[maxn]={0}; int main() { int n; for(int i=1;i<=maxn;i++){ ...

2023-01-11

1 311

题解 | #N阶楼梯上楼问题#

#include <cstdio> #include <iostream> using namespace std; const int maxn=91; int main() { long long f[maxn]={0}; int n; f[1]=...

2023-01-11

7 385

题解 | #二叉树#

#include <iostream> using namespace std; int n,m; int f(int m){ if(m>n) return 0; if(2*m>n && 2*m+1>n) return 1; return f(2...

2023-01-09

1 266