力扣：排列相关

1、给定一个整数数组 nums ，数组中的元素互不相同 。返回该数组所有可能的子集（幂集）。解集 不能 包含重复的子集。你可以按 任意顺序 返回解集。

class Solution_allSub {
public:
	vector<vector<int>>ans;
	vector<int>t;
	void dfs(int cur, vector<int>& nums) {
		if (cur == nums.size()) {
			ans.push_back(t);
			return;
		}
		t.push_back(nums[cur]);
		dfs(cur + 1, nums);
		t.pop_back();
		dfs(cur + 1, nums);
	}
	vector<vector<int>> subsets(vector<int>& nums) {
		dfs(0, nums);
		return ans;
	}
};

2、含有k个元素的组合，给定两个整数n和k，返回1…n中所有可能的k个数的组合

class Solution_nk {
public:
	vector<vector<int>>ans;
	vector<int>t;
	void dfs(int cur, int n, int k) {
		if (t.size() + n - cur + 1 < k)return;
		if (t.size() == k) {
			ans.push_back(t);
			return;
		}
		if (cur == (n + 1))return;
		t.push_back(cur);//选中cur
		dfs(cur + 1, n, k);
		t.pop_back();//不选cur
		dfs(cur + 1, n, k);
	}
	vector<vector<int>> combine(int n, int k) {
		if (k > n)return ans;
		dfs(1, n, k);
		return ans;
	}
};

3、允许重复选择元素的组合

class Solution_yuansuChongfu {
public:
	vector<vector<int>>ans;
	vector<int>path;
	void dfs(int ind, vector<int>& candidates, int target) {
		if (target < 0)return;
		if (target == 0) {
			ans.push_back(path);
			return;
		}
		for (int i = ind; i < candidates.size(); i++) {
			if (candidates[i] <= target) {
				path.push_back(candidates[i]);
				dfs(i, candidates, target - candidates[i]);
				path.pop_back();
			}
		}
	}
	vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
		dfs(0, candidates, target);
		return ans;
	}
};

4、含有重复元素的集合

class Solution_chongfuyaunsu {
public:
	vector<vector<int>>ans;
	vector<int>path;
	inline int getId(vector<int>& candidates, int ind) {
		for (int i = ind; i < candidates.size(); i++) {
			if (candidates[i] != candidates[ind])return i;
		}
		return candidates.size();
	}
	void dfs(int ind, vector<int>& candidates, int target) {
		if (target == 0) {
			ans.push_back(path);
			return;
		}
		if (target < 0 || ind == candidates.size())return;
		int id = getId(candidates, ind);
		dfs(id, candidates, target);
		path.push_back(candidates[ind]);
		dfs(ind + 1, candidates, target - candidates[ind]);
		path.pop_back();
	}
	vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
		sort(begin(candidates), end(candidates));
		dfs(0, candidates, target);
		return ans;
	}
};

5、无重复元素全排列

class Solution_quanpailie_wuchongfu {
public:
	vector<vector<int>>ans;
	void dfs(int cur, vector<int>& nums) {
		if (cur == nums.size() - 1) {
			ans.push_back(nums);
			return;
		}
		for (int i = cur; i < nums.size(); i++) {
			swap(nums[i], nums[cur]);
			dfs(cur + 1, nums);
			swap(nums[i], nums[cur]);
		}
	}
	vector<vector<int>> permute(vector<int>& nums) {
		dfs(0, nums);
		return ans;
	}
};

6、含有重复元素的全排列

class Solution_quanpailie_chongfu {
public:
	vector<vector<int>>ans;
	void dfs(int cur, vector<int>& nums) {
		if (cur == nums.size() - 1 && (find(begin(ans), end(ans), nums) == end(ans))) {
			ans.push_back(nums);
			return;
		}
		for (int i = cur; i < nums.size(); i++) {
			swap(nums[i], nums[cur]);
			dfs(cur + 1, nums);
			swap(nums[i], nums[cur]);
		}
	}
	vector<vector<int>> permuteUnique(vector<int>& nums) {
		dfs(0, nums);
		return ans;
	}
};

7、生成匹配的括号

//7、生成匹配的括号
class Solution_pipeikuohao {
public:
	vector<string>res;
	void dfs(int n, int lc, int rc, string ans) {
		if (lc == n && rc == n) {
			res.push_back(ans);
			return;
		}
		else {
			if (lc < n)dfs(n, lc + 1, rc, ans + "(");
			if (rc < n && rc < lc)dfs(n, lc, rc + 1, ans + ")");
		}
	}
	vector<string> generateParenthesis(int n) {
		dfs(n, 0, 0, "");
		return res;
	}
};

8、分割回文字符串

//8、分割回文字符串
class Solution_fengehuiwenchuan {
public:
	vector<vector<string>>ans;
	vector<string>path;
	void dfs(string& s, int cur) {
		if (cur == s.size()) {
			ans.push_back(path);
			return;
		}
		for (int i = cur; i < s.size(); i++) {
			if (isHui(s, cur, i)) {
				string temp = s.substr(cur, i - cur + 1);
				path.push_back(temp);
				dfs(s, i + 1);
				path.pop_back();
			}
		}
	}
	inline bool isHui(string& s, int l, int r) {
		while (l < r) {
			if (s[l++] != s[r--])return false;
		}
		return true;
	}
	vector<vector<string>> partition(string s) {
		dfs(s, 0);
		return ans;
	}
};

9、重复IP

//9、重复IP
class Solution_chongfuIP {
public:
	vector<string>ans;
	string path;
	int dot_n = 0;
	void dfs(string& s, int start) {
		if (dot_n == 4) {
			string sub_path = path;
			sub_path.pop_back();
			if (sub_path.size() == s.size() + 3)ans.push_back(sub_path);
			return;
		}
		for (int i = start; i < start + 3 && i < s.size(); i++) {
			string str = s.substr(start, i - start + 1);
			if (str.size() > 1 && str[0] == '0')continue;
			if (stoi(str) > 255)continue;
			path += str;
			path += '.';
			++dot_n;
			dfs(s, i + 1);
			--dot_n;
			path = path.substr(0, path.size() - str.size() - 1);
		}
	}
	vector<string> restoreIpAddresses(string s) {
		dfs(s, 0);
		return ans;
	}
};