题目:
Given a collection of numbers, return all possible permutations.
For example,
[1,2,3]
have the following permutations:
[1,2,3]
, [1,3,2]
, [2,1,3]
, [2,3,1]
, [3,1,2]
, and [3,2,1]
.
要求生成全排列,隐藏条件是数组中元素是不重复的。这题想到之前的next Permutation,只要生成n!次排列即可
当然这题还有许多思路,可以参考http://blog.csdn.net/tuantuanls/article/details/8717262,列出四种算法
import java.util.ArrayList;
import java.util.List;
public class No45_Permutation {
public static void main(String[] args){
System.out.println(permute(new int[]{1}));
}
public static List<List<Integer>> permute(int[] num) {
List ret = new ArrayList<List<Integer>>();
for(int i=0;i<factorial(num.length);i++){
nextPermutation(num);
List<Integer> element = new ArrayList<Integer>();
for(int j=0;j<num.length;j++){
element.add(num[j]);
}
ret.add(element);
}
return ret;
}
public static int factorial(int n){
if(n==0||n==1) return 1;
return factorial(n-1)*n;
}
public static void nextPermutation(int[] num) {
int index = 0;
for(int i=1;i<num.length;i++){
if(num[i]>num[i-1]){
index = i;
}
}
if(index != 0){
int i = index;
while(i< num.length && num[i] > num[index-1]) i++;
num[index-1] += num[i-1];
num[i-1] = num[index-1] - num[i-1];
num[index-1] = num[index-1] - num[i-1];
}
reverse(num, index, num.length-1);
}
public static void reverse(int[] num, int start, int end){
for(int i=0;i<=(end-start)/2;i++){
int tmp = num[start+i];
num[start+i] = num[end-i];
num[end-i] = tmp;
}
}
}