绿色菜狗的自我修养

分类

/ 注册

全部文章（共12篇）

题解 | 二叉搜索树与双向链表

/* struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) { } };*/ class ...

2025-04-14

0 11

题解 | 创建二维动态数组

#include<bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; // write your code here...... vector<vector<...

2025-04-04

0 16

题解 | 数组元素处理

#include <iostream> using namespace std; void func(int* p, int n); int main() { int arr[6] = { 0 }; for (int i = 0; i < 6; i++) { ...

2025-04-02

0 21

题解 | 计算小球走过的路程和反弹高度

#include <iostream> #include <iomanip> using namespace std; int main() { // 下落的高度和落地的次数 double h; int n; cin >> h...

2025-03-30

0 23

题解 | 逆波兰表达式求值

#include<string.h> class Solution { public: /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * * @param tokens string字符串vec...

2025-03-29

0 25

题解 | #圣诞树#

#define _CRT_SECURE_NO_WARNINGS #include<stdio.h> int main() { int n = 0; scanf("%d", &n); for (int i = 1; i <= n; ...

2024-12-10

1 60

题解 | #KiKi学结构体和指针#

#define _CRT_SECURE_NO_WARNINGS #include<stdio.h> #include<malloc.h> typedef struct SlistNode { int data; struct SlistNode* next; ...

2024-12-09

1 50

题解 | #公务员面试#

#define _CRT_SECURE_NO_WARNINGS #include<stdio.h> int main() { int arr[7]; int max = 0; int min = 100; int sum = 0; int n = 0; int i = 0; ...

2024-11-29

0 45

题解 | #变种水仙花#

#define _CRT_SECURE_NO_WARNINGS #include<stdio.h> int main() { int a=10000; int sum = 0; for (; a < 100000; a++) { sum = 0; for (int ...

2024-11-22

0 37

题解 | #计算球体的体积#

#define _CRT_SECURE_NO_WARNINGS #include<stdio.h> #include<math.h> int main() { double a = 0; scanf("%lf", &a); double pi...

2024-11-21

0 42