Backtracing problems 46 Permutations I Example 1: Input: nums = [1,2,3]
Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] Example 2: Input: nums = [0,1]
Output: [[0,1],[1,0]] Solution class Solution {
public:
void permute(vector<vector<int>>& answer, vector<int> nums, int begin) {
if (begin == nums.size()) {
answer.push_back(nums);
return;
}
for (int i=begin; i<nums.size(); …