首页 > 代码库 > java递归实现全排列
java递归实现全排列
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Test{
private static String[] s = new String[]{"1","2","3","4"};
private static int l = s.length;
public static void main(String[] args) {
List<String> source = Arrays.asList(s);
List<String> target = new ArrayList<String>();
sort(source,target);
}
private static void sort(List<String> source, List<String> target) {
if(target.size() == l){
for(int i=0;i<target.size();i++){
System.out.print(target.get(i));
}
System.out.println();
}
for(int i=0;i<source.size();i++){
List<String> targetList = new ArrayList<String>(target);
targetList.add(source.get(i));
List<String> resourceList = new ArrayList<String>(source);
resourceList.remove(i);
sort(resourceList,targetList);
}
}
}
java递归实现全排列