Permutations

 1 public class Solution {
 2     private boolean isVisited[];
 3     
 4     public List<List<Integer>> permute(int[] num) {   
 5         isVisited = new boolean[num.length];
 6         List<List<Integer>> result = new ArrayList<List<Integer>>();
 7         dfs(result, num, 0, new ArrayList<Integer>());
 8         
 9         return result;
10     }
11     
12     /**
13      * 深度遍历数组
14      * @param num
15      * @param dep
16      */
17     private void dfs(List<List<Integer>> result, int num[], int dep, List<Integer> cur){
18         if(dep != num.length){
19             for(int i = 0; i < num.length; i++){
20                 if(isVisited[i] == false){
21                     isVisited[i] = true;
22                     cur.add(num[i]);
23                     dfs(result, num, dep + 1, cur);
24                     isVisited[i] = false;
25                     cur.remove(cur.size() - 1);
26                 }//if
27             }//for
28         }//if
29         else{
30             result.add(new ArrayList<Integer>(cur));
31         }
32     }
33 }