shininggirls01

分类

/ 注册

全部文章（共49篇）

题解 | #哈夫曼树#

#include <iostream> #include<queue> #include<string> #include<cstdio> #include<cstring> using namespace std; int main()...

2024-04-02

0 165

题解 | #复数集合#

#include <iostream> #include<queue> #include<cstdio> #include<cstring> #include<string> #include<cmath>//求次幂，是pow，...

2024-04-02

0 197

题解 | #复数集合#

#include <iostream> #include<queue> #include<cstdio> #include<cstring> #include<string> #include<cmath>//求次幂，是pow，...

2024-04-02

0 236

题解 | #二叉排序树#

#include <iostream> #include<cstring> #include<cstdio> #include<string> #include<vector> //本题理解题意错误 //错误理解：建立二叉排序树时要添加重复...

2024-03-31

0 206

题解 | #二叉排序树#

#include <iostream> #include<vector> using namespace std; typedef struct Binode { int data; struct Binode* lchild; struct Bin...

2024-03-30

0 176

题解 | #二叉树遍历#

#include <iostream> #include<string> #include<cstring> #include<cstdio> using namespace std; typedef struct Binode { char ...

2024-03-30

0 173

题解 | #二叉树遍历#

#include <iostream> #include <string> #include<cstring> #include <cstdio> using namespace std; typedef struct Binode { cha...

2024-03-30

0 233

题解 | #二叉树#

#include <iostream> using namespace std; //完全二叉树左2i右2i+1 int Cal(int m, int n) { if (m > n) return 0; return 1 + Cal(2 * m, n) + Cal...

2024-03-29

0 167

题解 | #Fibonacci#

#include <iostream> using namespace std; int F(int N) { if (N == 0 || N == 1) return N; return F(N - 1) + F(N - 2); } int main() { ...

2024-03-29

0 150

题解 | #n的阶乘#

#include <iostream> using namespace std; long long multi(long long n) { long long res = 1; if (n == 1) return n; return n * multi(n...

2024-03-29

0 141