class Solution {
public:
vector<vector<int>>ret;
vector<int>path;
bool check[10]={false};
void dfs(vector<int>&nums)
{
if(path.size()==nums.size())
{
ret.push_back(path);
return ;
}
for(int i=0;i<nums.size();i++)
{
if(check[i]!=true)
{
path.push_back(nums[i]);
check[i]=true;
dfs(nums);
path.pop_back();
check[i]=false;
}
}
}
vector<vector<int>> permute(vector<int>& nums) {
dfs(nums);
return ret;
}
};
class Solution {
public:
vector<vector<int>>ret;
vector<int>path;
void dfs(vector<int>&nums,int depth)
{
ret.push_back(path);
if(depth==nums.size())
{
return;
}
for(int i=depth;i<nums.size();i++)
{
path.push_back(nums[i]);
dfs(nums,i+1);
path.pop_back();
}
}
vector<vector<int>> subsets(vector<int>& nums) {
dfs(nums,0);
return ret;
}
};
class Solution {
public:
vector<vector<int>>ret;
vector<int>path;
void dfs(int n,int k,int depth)
{
if(k==path.size())
{
ret.push_back(path);
return;
}
for(int i=depth;i<=n;i++)
{
path.push_back(i);
dfs(n,k,i+1);
path.pop_back();
}
}
vector<vector<int>> combine(int n, int k) {
dfs(n,k,1);
return ret;
}
};
4.LCR 102. 目标和 - 力扣(LeetCode) (+=不能用在表达式中)
class Solution {
public:
int ret=0;
void dfs(vector<int>&nums,int ltarget,int start,int count)
{
if(start==nums.size())
{
if(ltarget==count)
{
ret++;
}
return;
}
dfs(nums,ltarget,start+1,count+nums[start]);
dfs(nums,ltarget,start+1,count-nums[start]);
}
int findTargetSumWays(vector<int>& nums, int ltarget) {
dfs(nums,ltarget,0,0);
return ret;
}
};
class Solution {
public:
TreeNode* pruneTree(TreeNode* root) {
if(root==nullptr)
{
return nullptr;
}
root->left= pruneTree(root->left);
root->right=pruneTree(root->right);
if(root->left==nullptr&&root->right==nullptr&&root->val==0)
{
root=nullptr;
return root;
}
return root;
}
};
class Solution {
public:
vector<vector<int>>ret;
vector<int>path;
void dfs(vector<int>&candidates,int sum,int target,int pos)
{
if(sum==target)
{
ret.push_back(path);
return ;
}
if(sum>target||pos==candidates.size())
{
return;
}
for(int k=0;sum+k*candidates[pos]<=target;k++)
{
if(k)
{
path.push_back(candidates[pos]);
}
dfs(candidates,sum+k*candidates[pos],target,pos+1);
}
for(int k=1;k*candidates[pos]+sum<=target;k++)
{
path.pop_back();
}
}
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
dfs(candidates,0,target,0);
return ret;
}
};