qtmatt的博客

#include<iostream>using namespace stdint n;void dfs(int u,int state){ if(u==n) { for(int i=0;i<n;i++) if(state>>i&1) { cout<<i+1<<" "; } return; ...

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; ...

class Solution { public: int numEquivDominoPairs(vector<vector<int>>& dominoes) { map<vector<int>,int>F; int res=0; for(auto p:dominoes) { ...

class Solution {public: vector<int> distributeCandies(int c, int n) { int res=0; vector<int>ans(n,0); while(c>0) { for(int i=0;i<n;i++) ...

class Solution {public: int largestUniqueNumber(vector<int>& A) { map<int,int>F; for(auto p:A) F[p]++; for(auto ia=F.rbegin();ia!=F.rend();ia++)...

//你可以假设 k 总是有效的，1 ≤ k ≤ 输入数组的大小，且输入数组不为空。 class Solution {public: vector<int> maxSlidingWindow(vector<int>& nums, int k) { int n=nums.size(); vector<int>an...

//对矩阵中轴水平反转，对每层未被交换过的元素进行规则交换；void rotate(vector<vector<int> > &matrix) { int n=matrix.size()-1; for(int x=0;x<=(n/2);x++) for(int y=0;y<matr...

class Solution { public: ListNode* reverseKGroup(ListNode* head, int k) { if(!head) return nullptr; ListNode* cur=head; int count=0; while(cur...

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas...

class Solution {public: int wiggleMaxLength(vector<int>& nums) { nums.erase(unique(nums.begin(),nums.end()),nums.end()); if(nums.size()<=2)return nums.size();...

class Solution {public: vector<vector<int>> reconstructQueue(vector<vector<int>>& people) { sort(people.begin(),people.end(),[&](vector<int>a,vect...

class Solution {public: vector<vector<int>> floodFill(vector<vector<int>>& image, int sr, int sc, int newColor) { if(image.size()==0)return image; i...

class Solution {public: int n,m; vector<vector<bool>>ans; void solve(vector<vector<char>>& board) { if(board.empty()||board[0].empty())return; ...

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla...

class Solution {public: vector< vector<int>>myv;//记录最终情况 vector<bool>record;//记录每个元素是否被访问过 vector<int>mynum;//记录每种情况； void dfs(vector<int>& num...

class Solution {public: vector<vector<int>>ans; void dfs(vector<int>&path,int start,int n,int k)//（第一个参数为存储的结果，第二个参数是当前选元素，第三个是n个数，第四个是选k个） { if(!k) ...

#include<iostream>using namespace std;int n,m;void dfs(int u,int sum,int state){ if(sum+n-u<m)return; if(sum==m) { for(int i=0;i<n;i++) if(state>>i&...

class Solution {public: vector<string>mys; vector<string> letterCasePermutation(string S) { dfs(S,0); return mys; } void dfs(string S,int n) ...

//暴力枚举；int isPrime(int n){ if(n<=1)return 0; for(int i=2;i*i<=n;i++) if(n%i==0)return 0; return 1; //每个数我们需要枚举sqrt(n)次，有n个数需要o（nsqrt(n)）;}//埃拉托斯特尼筛 memset(falg,0,sizeof(flag)); int...