Douglas_LT的博客

每日一题ing，今天是个medium题300. Longest Increasing Subsequenceclass Solution {public: vector<vector<int>> permute(vector<int>& nums) { int len=nums.size(); vector<vector<int>> ret; dfs(nums,ret,0,len)

每日一题ing，今天是个medium题665. Non-decreasing Arrayclass Solution {public: bool checkPossibility(vector<int>& nums) { int len=nums.size(),count=0; if(len<=1){ return true; } for(int i=1;i<len;i++)

每日一题ing，今天是个medium题力扣435. Non-overlapping Intervalsclass Solution {public: int candy(vector<int>& ratings) { int min=0; vector<int> mark; for(int i=0;i<ratings.size();i++) { mark.push_bac

codeup最长回文子串#pragma warning(disable :4996)#include<iostream>#include<cstdlib>#include<cstdio>#include <stdio.h>#include<string> #include<vector>#include<algorithm>#include<map>using namespace std;

#pragma warning(disable :4996)#include<iostream>#include<cstdlib>#include<cstdio>#include <stdio.h>#include<string> #include<vector>#include<algorithm>#include<map>using namespace std;int main(){

#pragma warning(disable :4996)#include<iostream>#include<cstdlib>#include<cstdio>#include <stdio.h>#include<string> #include<vector>#include<algorithm>#include<map>using namespace std;typedef long

#include<iostream>#include<string>#include<queue>#include<stack>#include<map>#include<cstdio>using namespace std;struct node{ bool opORnum; double num; char opre;};string str;queue<node>q;stack&lt

错误点：1.两处内存超限2.一处答案错误#pragma warning(disable:4996)#include<stdio.h>#include<string>#include<algorithm>#include<iostream>using namespace std;struct info{ int weight; int value;}package[10010];int dp[10010][10010];int f

#pragma warning(disable:4996)#include<stdio.h>#include<string>#include<algorithm>using namespace std;int dp[1010][1010];int strlen(char s[]){ int i = 0; while (s[i] != '\0') i++; return i;}int main(){ char s[1010]; int

稍稍变形的最长公共子序列#pragma warning(disable:4996)#include<stdio.h>#include<string>#include<algorithm>using namespace std;int dp[10010][10010];int main(){ int a[10010], b[10010]; int n, m, l; scanf("%d", &n); scanf("%d", &m);

#pragma warning(disable:4996)#include<iostream>#include<string>#include<cstdio>#include<cmath>#include<algorithm>using namespace std;int main(){ int n,a[10010],dp[10010],s[10010]; scanf("%d", &n); int flag = 1;

注意库存小于需求量的情况#pragma warning(disable:4996)#include<iostream>#include<string>#include<cstdio>#include<cmath>#include<algorithm>using namespace std;struct info{ double weight; double price;}infor[1010];int main()

#pragma warning(disable:4996)#include<iostream>#include<string>#include<cstdio>#include<cmath>using namespace std;int n = 5;int flag[6], pre[6];void init(){ memset(flag, 0, sizeof(flag)); memset(pre, 0, sizeof(pre));}