@@ -34,17 +34,17 @@ public List<List<Integer>> permuteUnique(int[] nums) {
3434 Arrays .sort (nums );
3535
3636 boolean [] used = new boolean [nums .length ];
37- dfs ( nums , nums .length , 0 , used , new ArrayList <>(), res );
37+ backtrack ( 0 , nums .length , nums , used , new ArrayList <>(), res );
3838 return res ;
3939 }
4040
41- private void dfs (int [] nums , int len , int depth , boolean [] used , List <Integer > curList , List <List <Integer >> res ) {
41+ private void backtrack (int depth , int len , int [] nums , boolean [] used , List <Integer > curList , List <List <Integer >> res ) {
4242 if (depth == len ) {
4343 res .add (new ArrayList <>(curList ));
4444 return ;
4545 }
4646
47- for (int i = 0 ; i < len ; ++ i ) {
47+ for (int i = 0 ; i < len ; i ++ ) {
4848 if (used [i ]) {
4949 continue ;
5050 }
@@ -57,7 +57,7 @@ private void dfs(int[] nums, int len, int depth, boolean[] used, List<Integer> c
5757
5858 curList .add (nums [i ]);
5959 used [i ] = true ;
60- dfs ( nums , len , depth + 1 , used , curList , res );
60+ backtrack ( depth + 1 , len , nums , used , curList , res );
6161 // 回溯部分的代码,和 dfs 之前的代码是对称的
6262 used [i ] = false ;
6363 curList .remove (curList .size () - 1 );
@@ -68,5 +68,37 @@ private void dfs(int[] nums, int len, int depth, boolean[] used, List<Integer> c
6868 public void testCase () {
6969 int [] nums = {1 , 1 , 2 };
7070 System .out .println (JSONObject .toJSONString (permuteUnique (nums )));
71+ System .out .println (JSONObject .toJSONString (permuteUnique2 (nums )));
72+ }
73+
74+ public List <List <Integer >> permuteUnique2 (int [] nums ) {
75+ if (nums == null || nums .length == 0 ) {
76+ return null ;
77+ }
78+ Arrays .sort (nums );
79+ List <List <Integer >> res = new ArrayList <>();
80+ boolean [] used = new boolean [nums .length ];
81+ dfs (0 , nums .length , nums , used , new ArrayList <>(), res );
82+ return res ;
83+ }
84+
85+ private void dfs (int depth , int len , int [] nums , boolean [] used , List <Integer > curList , List <List <Integer >> res ) {
86+ if (depth == len ) {
87+ res .add (new ArrayList <>(curList ));
88+ return ;
89+ }
90+ for (int i = 0 ; i < len ; i ++) {
91+ if (used [i ]) {
92+ continue ;
93+ }
94+ if (i > 0 && nums [i - 1 ] == nums [i ] && !used [i - 1 ]) {
95+ continue ;
96+ }
97+ used [i ] = true ;
98+ curList .add (nums [i ]);
99+ dfs (depth + 1 , len , nums , used , curList , res );
100+ curList .remove (curList .size () - 1 );
101+ used [i ] = false ;
102+ }
71103 }
72104}
0 commit comments