【回溯】排列

题目：给出123的所有排列

class SolutionPermutation{
public:
	vector<vector<int>> ans;
public:
	void BackTracking(vector<int>& nums, int idx) {
		if (idx == nums.size()){
			ans.emplace_back(nums);
			return;
		}
		for(int i=idx;i<nums.size();++i) {
			swap(nums[i], nums[idx]);
			BackTracking(nums, idx+1);
			swap(nums[i], nums[idx]);
		}
	}
	vector<vector<int>> Permutate(vector<int>& nums) {	
		BackTracking(nums, 0);
		return ans;	
	}
};

回溯过程