JAVA全排列递归算法

2019-11-07 22:56:20

字体：大中小

来源：转载

供稿：网友

public static void main(String[] args) { Vector<String> source = new Vector<String>(Arrays.asList(new String[] { "A", "B", "C" })); Vector<String> result = new Vector<String>(); PRem(source, result);//递归入口 } private static void prem(Vector<String> source, Vector<String> result) { if (source.size() == 0) {//递归出口 for (int i = 0; i < result.size(); i++) { System.out.print(result.elementAt(i)); } System.out.println(); return; } for (int i = 0; i < source.size(); i++) { Vector<String> tSource = new Vector<String>(source); Vector<String> tResult = new Vector<String>(result); tResult.add(tSource.elementAt(i)); tSource.remove(i); prem(tSource, tResult); } }

运行结果：

ABCACBBACBCACABCBA

上一篇：JAVA组合递归算法

下一篇：java史和基础散点