lintcode15全排列java_Lintcode算法题：全排列

描述

给定一个数字列表，返回其所有可能的排列。

你可以假设没有重复数字。

样例

给出一个列表[1,2,3]，其全排列为：

[

[1,2,3],

[1,3,2],

[2,1,3],

[2,3,1],

[3,1,2],

[3,2,1]

]

挑战

使用递归和非递归分别解决。

public class Solution {

public List> permute(int[] nums) {

List> results = new ArrayList<>();

if (nums == null) {

return results;

}

if (nums.length == 0) {

results.add(new ArrayList());

return results;

}

List permutation = new ArrayList();

Set set = new HashSet<>();

helper(nums, permutation, set, results);

return results;

}

// 1. 找到所有以permutation 开头的排列

public void helper(int[] nums,

List permutation,

Set set,

List> results) {

// 3. 递归的出口

if (permutation.size() == nums.length) {

results.add(new ArrayList(permutation));

return;

}

// [3] => [3,1], [3,2], [3,4] ...

for (int i = 0; i < nums.length; i++) {

if (set.contains(nums[i])) {

continue;

}

permutation.add(nums[i]);

set.add(nums[i]);

helper(nums, permutation, set, results);

set.remove(nums[i]);

permutation.remove(permutation.size() - 1);

}

}

}

// Non-Recursion

class Solution {

/**

* @param nums: A list of integers.

* @return: A list of permutations.

*/

public List> permute(int[] nums) {

ArrayList> permutations

= new ArrayList>();

if (nums == null) {

return permutations;

}

if (nums.length == 0) {

permutations.add(new ArrayList());

return permutations;

}

int n = nums.length;

ArrayList stack = new ArrayList();

stack.add(-1);

while (stack.size() != 0) {

Integer last = stack.get(stack.size() - 1);

stack.remove(stack.size() - 1);

// increase the last number

int next = -1;

for (int i = last + 1; i < n; i++) {

if (!stack.contains(i)) {

next = i;

break;

}

}

if (next == -1) {

continue;

}

// generate the next permutation

stack.add(next);

for (int i = 0; i < n; i++) {

if (!stack.contains(i)) {

stack.add(i);

}

}

// copy to permutations set

ArrayList permutation = new ArrayList();

for (int i = 0; i < n; i++) {

permutation.add(nums[stack.get(i)]);

}

permutations.add(permutation);

}

return permutations;

}

}