java全排列 去重,Java递归实现全排列改进(一) 利用HashSet实现去重

import java.util.ArrayList;

import java.util.Arrays;

import java.util.HashSet;

import java.util.Iterator;

import java.util.List;

import java.util.Set;

public class Test{

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

private static int l = s.length;

private static Set set = new HashSet();

public static void main(String[] args) {

List source = Arrays.asList(s);

List target = new ArrayList();

sort(source,target);

Iterator it = set.iterator();

while(it.hasNext()){

System.out.println(it.next());

}

}

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

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

set.add(target.toString().replaceAll(",", "").replace("[", "").replace("]", "").replace(" ", ""));

}

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);

}

}

}