LeetCode25回溯

* 491.递增子序列

class Solution {
    List<List<Integer>>result = new ArrayList<>();
    List<Integer> path = new ArrayList<>();
    public List<List<Integer>> findSubsequences(int[] nums) {
    backTracking(nums,0);
    return result;
    }
    public void backTracking(int[] nums,int startIndex){
        if(path.size() > 1)result.add(new ArrayList(path));
       
        int[] map = new int[201];
        Arrays.fill(map,0);
        for(int i = startIndex;i < nums.length;i++){
            if(!path.isEmpty() && nums[i] < path.get(path.size() - 1) || map[nums[i] + 100] == 1)
            continue;
            map[nums[i] + 100] = 1;
            path.add(nums[i]);
            backTracking(nums,i + 1);
            path.remove(path.size() - 1);
        }
        
    }
}

* 46.全排列

class Solution {
    List<List<Integer>> result = new ArrayList<>();
    List<Integer>path = new ArrayList<>();
    boolean[] used;
    public List<List<Integer>> permute(int[] nums) {
        used = new boolean[nums.length];
        Arrays.fill(used,false);
        backTracking(nums);

        return result;
    }
    private void backTracking(int[] nums){
        if(path.size() == nums.length){
            result.add(new ArrayList(path));
            return;
        }

        for(int i = 0;i < nums.length;i++){
            if(used[i] != false)continue;
            used[i] = true;
            path.add(nums[i]);
            backTracking(nums);
            path.remove(path.size() - 1);
            used[i] = false;
        }
    }
}

* 47.全排列 II

class Solution {
    List<List<Integer>> result = new ArrayList<>();
    List<Integer> path = new ArrayList<>();
    boolean[] colUsed;

    public List<List<Integer>> permuteUnique(int[] nums) {
        colUsed = new boolean[nums.length];

        Arrays.fill(colUsed,false);

        Arrays.sort(nums);
        backTracking(nums);
        return result;
    }
    private void backTracking(int[] nums){
        if(path.size() == nums.length){
            result.add(new ArrayList(path));
            return;
        }
        boolean[] rowUsed = new boolean[nums.length];
        Arrays.fill(rowUsed , false);
        for(int i = 0;i < nums.length;i++){
            if((i != 0 && nums[i] == nums[i - 1] && rowUsed[i - 1] == true)){rowUsed[i] = true;continue;}
            if(colUsed[i] != false)continue;
            rowUsed[i] = true;
            colUsed[i] = true;
            path.add(nums[i]);
            backTracking(nums);
            colUsed[i] = false;
            path.remove(path.size() - 1);
        }
    }
}