排列&组合问题
有两类很经典的问题, 排列问题即全排列问题; 组合问题即求子集问题.
全排列
一般情况,可能包含重复元素.
class Solution {
public List<List<Integer>> permute(int[] nums) {
List<List<Integer>> res = new ArrayList<>();
if (nums == null || nums.length == 0) {
return res;
}
Arrays.sort(nums);
List<Integer> path = new ArrayList<>();
boolean[] vis = new boolean[nums.length];
helper(nums, path, vis, res);
return res;
}
private void helper(int[] nums, List<Integer> path,
boolean[] vis, List<List<Integer>> res) {
if (nums.length == path.size()) {
res.add(new ArrayList<>(path));
return;
}
for (int i = 0; i < nums.length; i++) {
if (vis[i]) {
continue;
}
if (i > 0 && nums[i] == nums[i - 1] && !vis[i - 1]) {
continue;
}
path.add(nums[i]);
vis[i] = true;
helper(nums, path, vis, res);
path.remove(path.size() - 1);
vis[i] = false;
}
}
}
子集
一般情况,可能包含重复元素
class Solution {
public List<List<Integer>> subsets(int[] nums) {
List<List<Integer>> res = new ArrayList<>();
if (nums == null || nums.length == 0) {
return res;
}
Arrays.sort(nums);
List<Integer> path = new ArrayList<>();
boolean[] vis = new boolean[nums.length];
helper(nums, path, res, vis, 0);
return res;
}
private void helper(int[] nums, List<Integer> path,
List<List<Integer>> res, boolean[] vis, int startIndex) {
res.add(new ArrayList<>(path));
for (int i = startIndex; i < nums.length; i++) {
if (vis[i]) {
continue;
}
if (i != startIndex && nums[i] == nums[i - 1] && !vis[i - 1]) {
continue;
}
path.add(nums[i]);
vis[i] = true;
helper(nums, path, res, vis, i + 1);
path.remove(path.size() - 1);
vis[i] = false;
}
}
}
Tips:
注意这里的startIndex用来表示方向性,比如 [1, 3, 2]和 [1, 2, 3]属于同一个子集, 但是是不同的排列。。这是和排列的最大区别