46. Permutations

46. Permutations
    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]
]
python

class Solution:
    def permute(self, nums):
        self.res = []
        self.dfs(nums, [])
        return self.res

    def dfs(self, nums, temp):
        if len(nums) == len(temp):
            self.res.append(temp[:])
            return

        for i in range(len(nums)):
            if nums[i] in temp: continue
            temp.append(nums[i])
            self.dfs(nums, temp)
            temp.pop()

java:

class Solution {
    public  List<List<Integer>> permute(int[] nums) {
        List<List<Integer>> list = new ArrayList<>();
        if(nums == null || nums.length == 0 ) return list;
        backtrack(list, new ArrayList<>(), nums);
        return list;
    }

    private  void backtrack(List<List<Integer>> list, List<Integer> tempList, int [] nums){
        if(tempList.size() == nums.length){
            list.add(new ArrayList<>(tempList));
        } else{
            for(int i = 0; i < nums.length; i++){
                if(tempList.size() != 0 & tempList.contains(nums[i]))
                    continue;
                tempList.add(nums[i]);
                backtrack(list, tempList, nums);
                tempList.remove(tempList.size()-1);
            }
        }
    }

}