java递归全排列_全排列－－递归算法

import java.util.ArrayList;

import java.util.List;

public class PaiLie {

/**

* @param args

*/

public static void main(String[] args) {

List strList = new ArrayList();

strList.add("a");

strList.add("b");

strList.add("c");

quanpailie(strList, 0);

}

/**

* 按递归算法列出全排列

* @param strList

* @param cur

*/

private static void quanpailie(List strList, int cur)

{

if(cur >= strList.size()) {

System.out.println(strList);

return;

}

for(int i = cur; i < strList.size(); i++)

{

wape(strList, cur, i);

quanpailie(strList, cur+1);

wape(strList, cur, i);

}

}

/**

* 交换第i和j位置的值

* @param strList

* @param i

* @param j

*/

private static void wape(List strList, int i,int j )

{

String temp = strList.get(i);

strList.set(i, strList.get(j));

strList.set(j, temp);

}

}

posted on 2010-01-19 11:46 飞熊 阅读(177) 评论(0)  编辑  收藏 所属分类: 算法