爱喝零度可乐

分类

/ 注册

全部文章（共85篇）

题解 | #二叉搜索树#

#include<cstdio> #include<string> using namespace std; struct TreeNode { char data; TreeNode* LChild; TreeNode* RChild; }; v...

2023-03-11

0 259

题解 | #二叉排序树#

#include<cstdio> #include<string> struct TreeNode { int data; TreeNode* LChild; TreeNode* RChild; }; void InsertBST(TreeNode*...

2023-03-11

0 220

题解 | #二叉树遍历#

#include<cstdio> #include<string> using namespace std; struct TreeNode { char data; TreeNode* LChild; TreeNode* RChild; }; Tre...

2023-03-11

0 242

题解 | #二叉树遍历#

#include<cstdio> #include<string> using namespace std; struct TreeNode { char data; TreeNode* LChild; TreeNode* RChild; }; T...

2023-03-11

0 231

题解 | #全排列#

#include <cstdio> #include <algorithm> #include<string> using namespace std; int main() { string s; char arr[7]; while (...

2023-03-08

0 203

题解 | #二叉树#

#include<cstdio> int tree(int m,int n){ if(m > n){ return 0; }else{ return 1+tree(2*m,n)+tree(2*m+1,n); } } int ...

2023-03-08

0 231

题解 | #Fibonacci#

#include<cstdio> int func(int n) { if (n == 0 ) { return 0; } else if (n == 1) { return 1; } else { r...

2023-03-08

0 290

题解 | #Fibonacci#

#include<cstdio> int func(int n) { if (n == 0 ) { return 0; } else if (n == 1) { return 1; } else if (n == 2) { ...

2023-03-08

0 252

题解 | #堆栈的使用#

#include<cstdio> #include<stack> using namespace std; int main() { int n ; char x; int y ; stack<int> myStack; ...

2023-03-07

0 288

题解 | #简单计算器#

#include<cstdio> #include<string> #include<map> #include<stack> using namespace std; int main() { char arr[300]; map&...

2023-03-07

0 281