题目46. 全排列
function permute(nums: number[]): number[][] {
const result: number[][] = [];
const stepFlag:any = {};
const backtracking = (nums: number[], curNodes: number[]) => {
if(curNodes.length === nums.length){
result.push([...curNodes]);
}
for(let i=0;i<nums.length;i++){
if(stepFlag[i]) continue;
curNodes.push(nums[i]);
stepFlag[i] = true;
backtracking(nums, curNodes);
curNodes.pop();
stepFlag[i] = false;
}
return result;
}
backtracking(nums, []);
return result;
};
// console.log(permute([1,2,3]));