JAVA算法:给定一个没有重复数字的序列,返回其所有可能的全排列。
package com.bean.algorithm.basic;import java.util.ArrayList;
import java.util.Arrays;
import java.util.Iterator;
import java.util.List;public class PermuteRecursionNumber {private void swap(int[] array, int i, int j) {int temp = array[i];array[i] = array[j];array[j] = temp;}private void permuteRecursion(int[] nums, int start, int end, Integer[] nums_Integer, List<List<Integer>> result) {if (start == end) {/** for(int i = 0; i<nums.length; i++) System.out.print(nums[i]);*//** * Integer[] nums_Integer = new Integer[nums.length];*/for (int i = 0; i < nums.length; i++)nums_Integer[i] = Integer.valueOf(nums[i]);List<Integer> temp = new ArrayList<Integer>(Arrays.asList(nums_Integer));result.add(temp);}for (int i = start; i <