8000 update _46 · githubniraj/Leetcode@30e65ce · GitHub
[go: up one dir, main page]

Skip to content

Commit 30e65ce

Browse files
update _46
1 parent aac8d0b commit 30e65ce

File tree

1 file changed

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

1 file changed

+6
-7
lines changed

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

Lines changed: 6 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -6,28 +6,27 @@
66
import java.util.Set;
77

88
public class _46 {
9-
109
public static class Solution1 {
1110
public List<List<Integer>> permute(int[] nums) {
1211
List<List<Integer>> result = new ArrayList();
1312
result.add(new ArrayList<>());
14-
return recursion(nums, 0, result);
13+
return recurse(nums, 0, result);
1514
}
1615

17-
private List<List<Integer>> recursion(int[] nums, int index, List<List<Integer>> result) {
16+
private List<List<Integer>> recurse(int[] nums, int index, List<List<Integer>> result) {
1817
if (index == nums.length) {
1918
return result;
2019
}
2120
List<List<Integer>> newResult = new ArrayList<>();
22-
for (List<Integer> eachList : result) {
23-
for (int i = 0; i <= eachList.size(); i++) {
24-
List<Integer> newList = new ArrayList<>(eachList);
21+
for (List<Integer> list : result) {
22+
for (int i = 0; i <= list.size(); i++) {
23+
List<Integer> newList = new ArrayList<>(list);
2524
newList.add(i, nums[index]);
2625
newResult.add(newList);
2726
}
2827
}
2928
result = newResult;
30-
return recursion(nums, index + 1, result);
29+
return recurse(nums, index + 1, result);
3130
}
3231
}
3332

0 commit comments

Comments
 (0)
0