46. 全排列

class Solution {
    List<List<Integer>> result;
    List<Integer> path;
    boolean[] visited;
    int[] arr;

    public List<List<Integer>> permute(int[] nums) {
        result = new ArrayList<>();
        path = new ArrayList<>(nums.length);
        visited = new boolean[nums.length];
        arr = nums;
        dfs();
        return result;
    }

    private void dfs() {
        if (path.size() >= arr.length) {
            result.add(new ArrayList<>(path));
            return;
        }
        for (int i = 0; i < arr.length; i++) {
            if (visited[i]) {
                continue;
            }
            visited[i] = true;
            path.add(arr[i]);
            dfs();
            visited[i] = false;
            path.remove(path.size() - 1);
        }
    }
}