Given a collection of distinct integers, return all possible permutations.
Example:
Input: [1,2,3]
Output:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
代码
/**
* @param {number[]} nums
* @return {number[][]}
*/
var permute = function(nums) {
var result = [];
recursive(nums, [], result);
return result;
};
function recursive(nums, temp, result){
if(nums.length == 1){
temp.push(nums[0]);
result.push(temp);
}else {
for(var i = 0;i < nums.length;i++){
var t1 = [].concat(temp);
t1.push(nums[i]);
var t = [].concat(nums.slice(0,i));
t = t.concat(nums.slice(i+1,nums.length));
recursive(t,t1,result);
}
}
}