java全排列_JAVA全排列，递归

package org.hydrakyoufeng.test;

import java.util.Arrays;

/**

* JAVA全排列(递归)

* @author HydraKyouFeng

*

*/

public class FullPermutation {

/**

* 测试方法

* @param args

*/

public static void main(String[] args) {

int[] array = {1,2,3,4,5,6,7,8,9};

fullPermutation(array, 0);

}

public static void fullPermutation(int[] array, int index) {

if (index == array.length) {

System.out.println(Arrays.toString(array));

return;

}

for (int i = index; i < array.length; i++) {

changeIndex(array, index, i);

fullPermutation(array, index + 1);

changeIndex(array, index, i);

}

}

/**

* 交换arr中i和j的值

* @param arr

* @param i

* @param j

*/

public static void changeIndex(int[] array, int i, int j) {

int temp = array[i];

array[i] = array[j];

array[j] = temp;

}

}