心折风

分类

/ 注册

全部文章（共47篇）

题解 | 分组过滤练习题

select university, avg(question_cnt) as avg_question_cnt, avg(answer_cnt) as avg_answer_cnt from user_profile group by university...

2025-07-29

0 28

题解 | #字典树的实现#

#include <iostream> #include <vector> #include <string> using namespace std; struct TrieNode { int pass; int end; vect...

2024-09-28

0 100

题解 | #字符串的全部子序列#

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

2024-09-14

0 162

题解 | #计算数组的小和#

#include <iostream> #include <vector> using namespace std; long long merge(vector<int>& arr,vector<int>& help,int l, i...

2024-08-07

0 181

题解 | #C++冒泡排序#

#include <iostream> using namespace std; int main() { int arr[6] = { 0 }; int len = sizeof(arr) / sizeof(int); for (int i = 0...

2024-06-29

0 163

题解 | #数组元素反转#

#include <iostream> using namespace std; int main() { int arr[6] = { 0 }; int len = sizeof(arr) / sizeof(int); for (int i = ...

2024-06-29

0 178

题解 | #获取数组最值#

#include <iostream> using namespace std; int main() { int arr[6] = { 0 }; int len = sizeof(arr) / sizeof(int); for (int i = 0...

2024-06-16

0 186

题解 | #获取数组最值#

#include <iostream> using namespace std; int main() { int arr[6] = { 0 }; int len = sizeof(arr) / sizeof(int); for (int i = 0...

2024-06-16

0 205

题解 | #判断一个数是不是质数#

#include <iostream> using namespace std; int main() { // write your code here...... int digit = 0; int flag = 0; cin >> ...

2024-06-16

0 256

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

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

2024-06-16

0 212