理性的追梦人躺平又起来了

分类

/ 注册

全部文章（共17篇）

题解 | #对称平方数1#

#include<cstdio> using namespace std; int Reverse(int n){ int reverse = 0; int remain; while(true){ remain = n%10; reverse = 10*reverse +...

2023-04-05

0 199

题解 | #反序数#

#include<cstdio> using namespace std; int reverse(int n){ //名为reverse的函数，有一个int参数，返回值是int类型 int remain ; int reverse = 0; while(n > 0){ ...

2023-04-05

0 303

题解 | #abc#

#include<cstdio> #include<cstdlib> using namespace std; int main(){ int a,b,c;//定义名字是a,b,c的三个整形变量 for(a = 0; a <= 9; ++a){ for(b = ...

2023-04-05

0 267

题解 | #魔咒词典#

#include<cstdio> #include<string> #include<map> using namespace std; int main(){ map<string,string> dict; //构建词典 while (tru...

2023-04-05

0 316

题解 | #查找学生信息#

#include<cstdio> #include<string> #include<map> using namespace std; struct Student{ string name; string gender; int age; }; int...

2023-04-04

0 267

题解 | #哈夫曼树#

#include<cstdio> #include<queue> using namespace std; int main(){ priority_queue<int> pqueue;//存入相反数 int n; scanf("%d",&n); for(...

2023-04-03

0 222

题解 | #复数集合#

#include<cstdio> #include<queue> #include<string> using namespace std; struct Complex{ int re; int im; }; bool operator < (Com...

2023-04-03

0 288

题解 | #二叉搜索树#

#include<cstdio> #include<string> using namespace std; struct TreeNode{ char data; TreeNode * leftChild; TreeNode * rightChild; }; voi...

2023-03-30

0 276

题解 | #二叉排序树#

#include<cstdio> #include<string> using namespace std; struct TreeNode{ int data; TreeNode * leftChild; TreeNode * rightChild; }; void...

2023-03-30

0 260

题解 | #二叉树遍历#

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

2023-03-30

0 295