#include #include using namespace std; // 线性筛算法生成素数 void linearSieve(int n, vector& isPrime) {     fill(isPrime.begin(), isPri...

#include <iostream> #include <vector> using namespace std; // 线性筛算法生成素数 void linearSieve(int n, vector<bool>& isPrime) ...

class Solution { public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { if(root == null || root == p || root...

class Solution { public: int DFS(TreeNode *root,int presum) { if(root==NULL)return 0; int sum=presum*10+root->v...

class Solution { public: bool hasPathSum(TreeNode* root, int targetSum) { if(root == NULL) { return false; ...

class Solution { public: int findMin(vector<int>& nums) { int low = 0; int high = nums.size() - 1; whi...

动态规划 #include <iostream> #include <string> #include <vector> using namespace std; class Solution { public: str...

1.力扣 寻找数组的中心索引 力扣参考答案 class Solution { public: int pivotIndex(vector<int> &nums) { int total = accumulate(nums.beg...

#include<iostream> #include<cstring> #include<vector> using namespace std; // 可以支配的钱数、清单上可选择的物品种类、输入物品的价格、输入物品的受欢迎程度、状态转移...

#include<iostream> using namespace std; int main() { int dp[1005][1005] = { 0 };//表示前i件物品是否能凑出重量为j的方案，0表示否，1表示是 int w[1005];//单个物品...

#include<iostream> using namespace std; int dp[21][1010]; int w[21], c[21]; int main() { int N, V; cin >> N >> V;//物品数...

#include<iostream> using namespace std; int dp[101][101]; int main() { string a,b; memset(dp, 0, sizeof(dp)); cin >> a >...

#include <bits/stdc++.h> using namespace std; int n,a[105],dp_h[105],dp_t[105]; int main(){ while(cin>>n){ for(int i...

#include<iostream> using namespace std; int dp[10000]; int a[10000]; int n; //求长度和求和 int LIS_nn() { int ans = 0; for (int i = 1;...

#define _CRT_SECURE_NO_WARNINGS #include<iostream> using namespace std; int dp[1000010]; int a[1000010]; long long maxx; int main() ...

#include<bits/stdc++.h> using namespace std; #include<queue> const int maxn = 505; bool mpt[maxn][maxn]; int lev[maxn];//点的入度 v...

待完成

#include<stdio.h> #include<algorithm> #include<iostream> using namespace std; #define INF 0x3f3f3f3f const int maxn = 105;...

#include<bits/stdc++.h> using namespace std; int m,n; bool isVisit[105][105] = {false}; char a[105][105]; int dir[8][2] = {0,1,1,1,1,0...

#include <bits/stdc++.h> #include <cmath> #include <cstdio> #include <cstdlib> #include <math.h> #include <...