JAVA_字符排序

算法是这样的，如果给定 N个不同字符，将这 N个字符全排列，最终的结果将会是 N! 种。如：给定 A
、B、C三个不同的字符，则结果为： ABC、ACB、BAC、 BCA、CAB、CBA一共 3!=3*2=6 种情况

package Question1_9;

import java.util.Scanner;
import java.util.Vector;

public class Full {
	public static long count = 0;

	private void fullPermutation(Vector<Character> sourse, Vector<Character> result) {
		if (sourse.size() == 0) {
			for (int i = 0; i < result.size(); i++) {
				System.out.print(result.elementAt(i));
			}
			System.out.print("\n");
			count++;
			return;
		}
		for (int i = 0; i < sourse.size(); i++) {
			Vector<Character> tsourse = new Vector<Character>(sourse);
			Vector<Character> tresult = new Vector<Character>(result);
			tresult.add(sourse.elementAt(i));
			tsourse.remove(i);
			new Full().fullPermutation(tsourse, tresult);
		}
	}

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		Vector<Character> sourse = new Vector<Character>();
		Vector<Character> result = new Vector<Character>();
		for (int i = 0; i < n; i++) {
			sourse.add((char) ('A' + i));
		}
		new Full().fullPermutation(sourse, result);
		System.out.println(Full.count);
	}
}

3
ABC
ACB
BAC
BCA
CAB
CBA
6

PS：本文原创首发于公众号「让我遇见相似的灵魂」，回复关键字获取完整解题思路，作者带你绕过解题时遇到的坑。