全排列算法实现

package com.arithmetic;

import java.util.ArrayList;
import java.util.List;

public class PermutationsCombinations {
	public static void generate(int count) {
		String[] original = new String[count];
		for (int i = 0; i < count; i++) {
			original[i] = "" + (i + 1);
		}
		List<String> list = new ArrayList<String>();
		go(list, original, 0, original.length - 1);
		System.out.println("size:" + list.size() + ". " + list);
	}

	private static void go(List<String> list, String[] original, int start,
			int end) {
		if (start == end) {
			StringBuffer sb = new StringBuffer();
			for (int i = 0; i <= end; i++) {
				sb.append(original[i]);
			}
			list.add(sb.toString());
		} else {
			for (int i = start; i <= end; i++) {
				String temp = original[start];
				original[start] = original[i];
				original[i] = temp;

				go(list,original, start + 1, end);

				temp = original[start];
				original[start] = original[i];
				original[i] = temp;
			}
		}
	}

	public static void perm(String[] original, int start, int end) {
		if (start == end) {// 当只要求对数组中一个字母进行全排列时，只要就按该数组输出即可
			for (int i = 0; i <= end; i++) {
				System.out.print(original[i]);
			}
			System.out.println();
		} else {// 多个字母全排列
			for (int i = start; i <= end; i++) {
				String temp = original[start];// 交换数组第一个元素与后续的元素
				original[start] = original[i];
				original[i] = temp;

				perm(original, start + 1, end);// 后续元素递归全排列

				temp = original[start];// 将交换后的数组还原
				original[start] = original[i];
				original[i] = temp;
			}
		}
	}

	public static void main(String[] args) {
		generate(5);
	}
}