递归实现全排序
import java.util.LinkedList;
import java.util.List;
public class TotalSort {
public static void main(String [] args){
String [] array =new String[]{"1","5","3","4"};
listAll(Arrays.asList(array),"");
}
public static void listAll(List<String> candidate,String prefix){
System.out.println(prefix);
for(int i=0;i<candidate.size();i++){
List<String> temp=new LinkedList<String>(candidate);
listAll(temp,prefix+temp.remove(i));
}
}
}