Skip to content

Commit 9a910a2

Browse files
refactor 46
1 parent 0a82f1e commit 9a910a2

File tree

1 file changed

+7
-8
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+7
-8
lines changed

src/main/java/com/fishercoder/solutions/_46.java

Lines changed: 7 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -27,24 +27,23 @@ public static class Solution1 {
2727
public List<List<Integer>> permute(int[] nums) {
2828
List<List<Integer>> result = new ArrayList();
2929
result.add(new ArrayList<>());
30-
return backtracking(result, nums, 0);
30+
return backtracking(nums, 0, result);
3131
}
3232

33-
private List<List<Integer>> backtracking(List<List<Integer>> result, int[] nums, int pos) {
34-
if (pos == nums.length) {
33+
private List<List<Integer>> backtracking(int[] nums, int index, List<List<Integer>> result) {
34+
if (index == nums.length) {
3535
return result;
3636
}
37-
List<List<Integer>> newResult = new ArrayList();
37+
List<List<Integer>> newResult = new ArrayList<>();
3838
for (List<Integer> eachList : result) {
3939
for (int i = 0; i <= eachList.size(); i++) {
40-
//attn: i starts from 0
41-
List<Integer> newList = new ArrayList(eachList);
42-
newList.add(i, nums[pos]);
40+
List<Integer> newList = new ArrayList<>(eachList);
41+
newList.add(i, nums[index]);
4342
newResult.add(newList);
4443
}
4544
}
4645
result = newResult;
47-
return backtracking(result, nums, pos + 1);
46+
return backtracking(nums, index + 1, result);
4847
}
4948
}
5049

0 commit comments

Comments
 (0)