排列

package 排列;

import java.util.Arrays;
import java.util.Iterator;
import java.util.LinkedList;

public class Permutation {
	int[] array = { 1, 2, 3, 4, 5 };
	LinkedList<int[]> solutionList = new LinkedList<int[]>();

	public void getSolution(int[] array, int first) {
		if (first == array.length - 1) {
			int[] kk = Arrays.copyOf(array, array.length);
			solutionList.add(kk);
			return;
		}
		for (int i = first; i < array.length; i++) {
			int temp = array[first];
			array[first] = array[i];
			array[i] = temp;
			getSolution(array, first + 1);
			temp = array[first];
			array[first] = array[i];
			array[i] = temp;
		}
	}

	public static void main(String[] args) {
		Permutation per = new Permutation();
		per.getSolution(per.array, 0);
		System.out.println("The result is : ");
		Iterator<int[]> ite = per.solutionList.iterator();
		while (ite.hasNext()) {
			int[] temp = (int[]) ite.next();
			for (int i = 0; i < temp.length; i++) {
				System.out.print(temp[i]);
			}
			System.out.println();
		}
	}
}