Leetcode46 全排列

#include<iostream>
#include<vector>
using namespace std;

//全排列
class Solution {
public:
	void DFS(vector<vector<int>>& res, vector<int>& tem, vector<int>nums,vector<bool>&used) {
		if (tem.size()== nums.size()) {
			res.push_back(tem);
			return;
		}
		for (int i = 0; i <int(nums.size()); i++) {
			if (!used[i]) {
				used[i] = true;
				tem.push_back(nums[i]);
				DFS(res, tem, nums, used);
				tem.pop_back();//注意回溯时后续的处理
				used[i] = false;
			}
		}
			return;
	}
	vector<vector<int>> permute(vector<int>& nums) {
		vector<vector<int>> res;
		vector<int> tem;
		vector<bool> used=vector<bool>(nums.size(),false);//用used当做标记矩阵，经常用到这个方法。
		DFS(res, tem, nums,used);
		return res;
	}
};