[英]Return all permutations of a given list recursively
The following algorithm prints all permutations of a given list arr
:以下算法打印给定列表arr
所有排列:
public class Permute {
static void permute(java.util.List<Integer> arr, int k) {
for (int i = k; i < arr.size(); i++) {
java.util.Collections.swap(arr, i, k);
permute(arr, k + 1);
java.util.Collections.swap(arr, k, i);
}
if (k == arr.size() - 1) {
System.out.println(java.util.Arrays.toString(arr.toArray()));
}
}
public static void main(String[] args) {
Permute.permute(java.util.Arrays.asList(1, 2, 3), 0);
}
}
(FYI: The algorithm is taken from this answer) (仅供参考:该算法取自this answer)
I would like to modify the algorithm so that it returns a list of all solutions instead of printing them, ie something like:我想修改算法,使其返回所有解决方案的列表,而不是打印它们,例如:
static List<List<Integer>> permute(java.util.List<Integer> arr, int k);
How would I do this?我该怎么做? I tried the following modification of the algorithm, but it didn't work:我尝试了对算法的以下修改,但没有奏效:
public class Permute {
static List<List<Integer>> permute(java.util.List<Integer> arr, int k) {
List<List<Integer>> arrs = new ArrayList<>();
for (int i = k; i < arr.size(); i++) {
java.util.Collections.swap(arr, i, k);
arrs.addAll(permute(arr, k + 1));
java.util.Collections.swap(arr, k, i);
}
if (k == arr.size() - 1) {
arrs.add(arr);
System.out.println(java.util.Arrays.toString(arr.toArray()));
}
return arrs;
}
public static void main(String[] args) {
List<Integer> arr = new ArrayList<>(Arrays.asList(1, 2, 3));
System.out.println(Permute.permute(arr, 0));
}
}
The code compiles and executes, but gives the wrong result of [[1, 2, 3], [1, 2, 3], [1, 2, 3], [1, 2, 3], [1, 2, 3], [1, 2, 3]]
.代码编译并执行,但给出了错误的结果[[1, 2, 3], [1, 2, 3], [1, 2, 3], [1, 2, 3], [1, 2, 3], [1, 2, 3]]
。 I'm having trouble seeing why the code doesn't work and how to do it correctly.我无法理解为什么代码不起作用以及如何正确执行。 Any help is appreciated.任何帮助表示赞赏。
You need to add a copy of the List
to the result instead of adding the same one each time.您需要将List
的副本添加到结果中,而不是每次都添加相同的副本。
Change改变
arrs.add(arr);
To到
arrs.add(new ArrayList<>(arr));
Full method:完整方法:
static List<List<Integer>> permute(java.util.List<Integer> arr, int k) {
List<List<Integer>> arrs = new ArrayList<>();
for (int i = k; i < arr.size(); i++) {
java.util.Collections.swap(arr, i, k);
arrs.addAll(permute(arr, k + 1));
java.util.Collections.swap(arr, k, i);
}
if (k == arr.size() - 1) {
arrs.add(new ArrayList<>(arr));
}
return arrs;
}
As Unmitigated has pointed out, you need to add a copy of the permuted list.正如 Unmitigated 指出的那样,您需要添加置换列表的副本。
Also, there's no need to create a new list to hold permutations at each level of the recursion.此外,无需创建一个新列表来保存每个递归级别的排列。 You could create a single list to hold the results and pass it as an argument:您可以创建一个列表来保存结果并将其作为参数传递:
static void permute(List<List<Integer>> res, List<Integer> arr, int k) {
if (k == arr.size() - 1) {
res.add(new ArrayList<>(arr));
return;
}
for (int i = k; i < arr.size(); i++) {
Collections.swap(arr, i, k);
permute(res, arr, k + 1);
Collections.swap(arr, k, i);
}
}
public static void main(String[] args) {
List<List<Integer>> res = new ArrayList<>();
permute(res, Arrays.asList(1, 2, 3), 0);
System.out.println(res);
}
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.