Leetcode_46_全排列_递归

一个个添加，添加满了加入ans，用visit数组记录现在还可以添加的元素下标

class Solution {
    List<List<Integer>> ans;
    int[] nums;
    int len;

    public List<List<Integer>> permute(int[] nums) {
        this.nums = nums;
        ans = new ArrayList<>();
        len = nums.length;
        List<Integer> list = new ArrayList<>();
        backtrack(list, 0, new boolean[len]);
        return ans;
    }

    void backtrack(List<Integer> list, int size, boolean[] visit) {
        if(size == len) {
            ans.add(new ArrayList<>(list));
            return;
        }
        for (int i = 0; i < len; i++) {
            if(!visit[i]) {
                visit[i] = true;
                list.add(nums[i]);
                backtrack(list, size + 1, visit);
                list.remove(size);
                visit[i] = false;
            }
        }
    }
}