陶良策

分类

/ 注册

全部文章（共66篇）

题解 | 字符串去特定字符

#include <iostream> using namespace std; int main() { string s; char c; while (cin >> s) { // 注意 while 处理多个 case cin....

2025-03-04

0 51

题解 | Problem E

#include <iostream> #include<stack> using namespace std; bool isbrackets(char ch) { if (ch == '{' || ch == '}' || ch == '(' || ch == ...

2025-03-04

0 39

题解 | 编排字符串

#include <iostream> #include<vector> using namespace std; int main() { int m; string s; while (cin >> m) { // 注意 while ...

2025-03-04

0 45

题解 | 计算表达式

#include <iostream> #include<stack> using namespace std; bool opPriority(char op1, char op2) { if ((op1 == '/' || op1 == '*') &&...

2025-03-04

0 51

题解 | 最小花费

#include <iostream> #include<vector> using namespace std; int caculatecost(int distance, int L1, int L2, int L3, int C1, int C2, int C3)...

2025-02-28

0 43

题解 | 最小花费

#include <iostream> #include<vector> using namespace std; int caculatecost(int distance, int L1, int L2, int L3, int C1, int C2, int C3)...

2025-02-28

0 47

题解 | 求最大最小数

#include <iostream> using namespace std; int main() { int N; int minval,maxval; while (cin >>N) { // 注意 while 处理多个 case ...

2025-02-28

0 30

题解 | 谁是你的潜在朋友

#include <iostream> #include<vector> using namespace std; int main() { int N,M; int book[201]; for(int i=0;i<201;i++)book[...

2025-02-28

0 29

题解 | Problem D

#include <iostream> using namespace std; string toPostorder(string& preorder,string& inorder){ if(preorder=="")return &qu...

2025-02-28

0 40

题解 | 二叉树

#include <iostream> #include<vector> using namespace std; void addNode(int& cnt, int m, int n) { if (m > n)return; cnt++; ...

2025-02-28

0 35