class Solution {
List<List<Integer>> res = new ArrayList<>();
LinkedList<Integer> path = new LinkedList<>();
public List<List<Integer>> subsets(int[] nums) {
backtracking(nums , 0);
return res;
}
public void backtracking(int[] nums , int startIndex){
//记录所有节点
res.add(new ArrayList<>(path));
for(int i = startIndex ; i<nums.length; i++){
path.add(nums[i]);
backtracking(nums , i+1);
path.removeLast();
}
}
}
class Solution {
List<List<Integer>> res = new ArrayList<>();
LinkedList<Integer> path = new LinkedList<>();
boolean[] used ;
public List<List<Integer>> subsetsWithDup(int[] nums) {
if(nums.length == 0) return res;
Arrays.sort(nums);
used =new boolean[nums.length];
Arrays.fill(used , false);
backtracking(nums , 0);
return res;
}
public void backtracking(int[] nums , int startIndex){
//记录所有节点
res.add(new ArrayList<>(path));
for(int i = startIndex ; i<nums.length; i++){
if (i > 0 && nums[i] == nums[i-1] && !used[i-1]){
continue;
}
used[i] = true;
path.add(nums[i]);
backtracking(nums , i+1);
path.removeLast();
used[i] = false;
}
}
}
class Solution {
List<List<Integer>> res = new ArrayList<>();
LinkedList<Integer> path = new LinkedList<>();
public List<List<Integer>> findSubsequences(int[] nums) {
backtracking(nums , 0);
return res;
}
public void backtracking(int[] nums , int startIndex){
//记录所有节点
if(path.size() > 1){
res.add(new ArrayList<>(path));
}
HashSet<Integer> map = new HashSet<>();
for(int i = startIndex ; i<nums.length; i++){
if(!path.isEmpty() && path.get(path.size()-1) > nums[i] || map.contains(nums[i])) continue;
path.add(nums[i]);
map.add(nums[i]);
backtracking(nums , i+1);
path.removeLast();
}
}
}
\\排列问题不用starindex啦;组合问题要用;
class Solution {
List<List<Integer>> res = new ArrayList<>();
LinkedList<Integer> path = new LinkedList<>();
boolean[] used ;
public List<List<Integer>> permute(int[] nums) {
if(nums.length == 0) return res;
Arrays.sort(nums);
used =new boolean[nums.length];
Arrays.fill(used , false);
backtracking(nums);
return res;
}
public void backtracking(int[] nums){
//记录所有节点
if(path.size() == nums.length){
res.add(new ArrayList<>(path));
}
for(int i =0 ; i<nums.length; i++){
if (used[i]){
continue;
}
used[i] = true;
path.add(nums[i]);
backtracking(nums);
path.removeLast();
used[i] = false;
}
}
}