leetcode腾讯精选046

题目：
https://leetcode-cn.com/problems/permutations/
代码：
void dfs(vector<vector> &res,vector nums,vector &out,bool *f,int total)
{
int size = out.size();
if(size == total)
{
res.push_back(out);
}

	for(int i = 0; i < total; i++)
	{
		if(!f[i])
		{
			out.push_back(nums[i]);
			f[i] = true;
			dfs(res,nums,out,f,total);
			f[i] = false;
			out.pop_back();
		}
	}
}

class Solution {
public:
vector<vector> permute(vector& nums) {

	vector<vector<int>> res;
	if(nums.empty())
		return res;
	int n = nums.size();
	bool *f = (bool *)malloc(sizeof(bool)*n);
	memset(f,0,sizeof(bool)*n);
	vector<int > out;
	dfs(res,nums,out,f,nums.size());
	free(f);
	return res;

}

};

结果：