靠近1
靠近1
全部文章
分类
归档
标签
去牛客网
登录
/
注册
靠近1的博客
全部文章
(共45篇)
题解 | #最长回文子序列#
#include <iostream> #include <cstring> using namespace std; int main() { int dp[1010][1010] = {0}; string s; cin>>s; ...
2024-08-03
0
141
题解 | #集合#
#include <iostream> #include <set> using namespace std; int main() { int n,m; cin>>n>>m; set<int> s; fo...
2024-08-03
0
112
题解 | #连续子数组最大和#
#include <iostream> using namespace std; const int N = 2e5 +10; int n; int arr[N] = {0}; int dp[N] = {0}; int main() { cin>>n; f...
2024-08-02
0
132
题解 | #礼物的最大价值#
class Solution { int dp[210][210] = {0}; public: int maxValue(vector<vector<int> >& grid) { int n = grid.size(); ...
2024-07-29
0
125
题解 | #小易的升级之路#
#include <iostream> using namespace std; int gcb(int a,int x) { if(x==0)return a; return gcb(x,a%x); } int main() { int n,x; while...
2024-07-29
0
100
题解 | #01背包#
class Solution { int dp[1010] = {0}; public: int knapsack(int V, int n, vector<vector<int> >& vw) { for(int i=0;i<...
2024-07-27
0
244
题解 | #压缩字符串(一)#
#include <string> class Solution { public: string compressString(string param) { int n = param.size(); string ret; ...
2024-07-27
0
126
题解 | #小乐乐改数字#
#include <iostream> #include <vector> #include <cstring> using namespace std; string s; int main() { cin>>s; for(int...
2024-07-26
0
128
题解 | #小乐乐改数字#
#include <iostream> #include <vector> using namespace std; int main() { int n; cin>>n; if(n==0) { cout<&...
2024-07-26
0
116
题解 | #DNA序列#
#include <iostream> using namespace std; int main() { string str; int n; cin>>str>>n; int m = str.size(); int num = ...
2024-07-26
0
144
首页
上一页
1
2
3
4
5
下一页
末页