MountainsHao

分类

/ 注册

全部文章（共74篇）

题解 | #二叉排序树#

#include <stdio.h> #include <stdlib.h> typedef struct TreeNode { int data; struct TreeNode* lchild; struct TreeNode* rchild; ...

2024-03-21

0 157

题解 | #树查找#

#include <stdio.h> #include <math.h> int main() { int n; while (scanf("%d", &n) != EOF) { int a[n]; ...

2024-03-19

0 199

题解 | #二叉树遍历#

#include<stdio.h> #include <stdlib.h> typedef struct TreeNode { char val; struct TreeNode* left; struct TreeNode* right; }Tree...

2024-03-19

0 242

题解 | #二叉树#

#include <stdio.h> int BinaryTree(int m, int n) { if (m <= n) { return 1 + BinaryTree(m * 2, n) + BinaryTree(m * 2 + 1, n); ...

2024-03-18

0 213

题解 | #二叉树遍历#

#include <stdio.h> #include <string.h> void getPostOrder(char* preOrder, char* inOrder, int len) { if (len <= 0) { return;...

2024-03-18

0 190

题解 | #二叉排序树#

#include <stdio.h> #include <stdlib.h> // 定义二叉树节点结构 typedef struct Node { int data; struct Node* left; struct Node* right; } ...

2024-03-17

0 244

题解 | #八进制#

#include <stdio.h> int main() { int n; while (scanf("%d",&n) != EOF) { int s[20],cnt=0,temp; while(n>0) { temp=n%8; ...

2024-03-17

0 157

题解 | #查找#

#include <stdio.h> int main() { int n,a[100]; while (scanf("%d", &n) != EOF) { for(int i=0; i<n; i++) { scanf("%d&...

2024-03-16

0 152

题解 | #找最小数#

#include <stdio.h> int main() { int n; while (scanf("%d", &n) != EOF) { int a[n][2], min1 = 1e9, min2 = 1e9; ...

2024-03-16

0 191

题解 | #找最小数#

#include <stdio.h> int main() { int n; while (scanf("%d", &n) != EOF) { int a[n][2]; for (int i = 0; i &l...

2024-03-16

0 199