lao_xiao

分类

/ 注册

全部文章（共29篇）

题解 | 移除链表元素

/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : val(x), next(nullptr) {} * }; */ class Solution { public: /*...

2026-04-24

0 5

题解 | 链表序列化

/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : val(x), next(nullptr) {} * }; */ class Solution { public: /*...

2026-04-24

0 7

题解 | 字符串操作

#include <iostream> #include <string> using namespace std; int main() { string s; int n,m; cin>>n>>m>>...

2026-04-21

0 9

题解 | BFS

#include <iostream> #include <string> #include <vector> using namespace std; vector<string> target = {"BOB", &quo...

2026-04-21

0 6

题解 | 无限长正整数排列字符串

#include <iostream> #include <string> #include <stack> using namespace std; string s; void add(string & s,int i){ stack&l...

2026-04-21

0 4

题解 | 【模板】分数取模

#include <iostream> using namespace std; typedef long long LL; const int P = 1e9 + 7; LL qpow(int b,int c){ if(c == 0) return 1; LL ...

2026-03-25

0 32

题解 | 子数列求积

#include <iostream> using namespace std; const int M = 1e9 + 7; const int N = 1e5 + 10; long long tree[N]; int a[N]; int n,q; long long ...

2026-03-25

0 41

题解 | 游游的最长稳定子数组

#include <iostream> #include <cmath> using namespace std; const int N = 1e5 + 10; int a[N]; int f[N]; int abs(int a,int b){ if(a...

2026-03-25

0 37

题解 | 最长不下降子序列

#include <iostream> using namespace std; const int N = 5e3 + 10; int a[N]; int dp[N]; int main() { int n; cin>>n; for(int...

2026-03-21

0 47

题解 | 【模板】分组背包

#include <iostream> #include <cstring> using namespace std; const int N = 2010; int w[N],v[N],h[N]; long long f[N][N]; int ne[N],idx;...

2026-03-20

0 30