【刷题】Leetcode 46. Permutations

这道题还比较顺利，10-15分钟的样子可以搞定。
Example:

Input: [1,2,3]
Output:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]

class Solution {
    public List<List<Integer>> permute(int[] nums) {
        List<List<Integer>> results = new ArrayList<List<Integer>>();
        List<Integer> list = new ArrayList<Integer>();
        int[] visited = new int[nums.length];
        for(int i = 0; i < visited.length; i++){
            visited[i] = 0;
        }
        helper(nums, results, list, 0, visited);
        return results;
    }
    //n是递归深度，visited是访问记录数组，如果访问过就置1.
    public void helper(int[] nums, List<List<Integer>> results,  List<Integer> list, int n, int[] visited){
        if(n == nums.length){
            results.add(new ArrayList<Integer>(list));
            return;
        }
      
        for(int i = 0; i < nums.length; i++){
            if(visited[i] == 0){
                visited[i] = 1;
                list.add(nums[i]);          
                helper(nums, results, list, n + 1, visited);    
                list.remove(list.size() - 1); //
                visited[i] = 0;
            }
        }
    }
}

Runtime: 1 ms, faster than 97.97% of Java online submissions for Permutations.
Memory Usage: 37.5 MB, less than 95.74% of Java online submissions for Permutations.

***注意：***如图所示，该题会发生按照箭头方向所示的回溯。回退到下一个求解方案时，会设置visited[] = 0。