java全排列arraylist_Java递归实现全排列改进(二)---利用ArrayList实现去重

import java.util.ArrayList;

import java.util.Arrays;

import java.util.List;

public class Test{

private static String[] s = new String[]{"a","b","a"};

private static int l = s.length;

private static List list = new ArrayList();

public static void main(String[] args) {

List source = Arrays.asList(s);

List target = new ArrayList();

sort(source,target);

}

private static void sort(List source, List target) {

if(target.size() == l){

if(!list.contains(target.toString())){

list.add(target.toString());

for(int i=0;i

System.out.print(target.get(i));

}

System.out.println();

}

}

for(int i=0;i

List targetList = new ArrayList(target);

targetList.add(source.get(i));

List resourceList = new ArrayList(source);

resourceList.remove(i);

sort(resourceList,targetList);

}

}

}

原文：http://blog.csdn.net/zkn_cs_dn_2013/article/details/42394609