代码随想录算法训练营第二五天| 491.递增子序列 46.全排列 47.全排列 II-CSDN博客

本文链接：https://blog.csdn.net/zzhnwpu/article/details/142007090

今日任务

491.递增子序列
46.全排列
47.全排列 II

491.递增子序列

class Solution {
    List<List<Integer>>  result = new ArrayList<>();
    List<Integer>  path = new ArrayList<>();
    Set<List<Integer>> set = new HashSet<>();

    public List<List<Integer>> findSubsequences(int[] nums) {
        retrospective(path, nums, 0);
        return result;
    }

    public void retrospective(List<Integer> path, int[] nums, int startIndex) {
        if (startIndex == nums.length) {return;}
        for (int i = startIndex; i < nums.length; i++) {
            path.add(nums[i]);
            ArrayList<Integer> tmpPath = new ArrayList<>(path);
            if (!set.contains(tmpPath)) {
                if (check(tmpPath)) {
                    result.add(tmpPath);
                }
                set.add(tmpPath);
            }
            retrospective(path, nums, i + 1);
            path.remove(path.size() - 1);
        }
        return;
    }

    public boolean check(ArrayList<Integer> path){
        int pre = Integer.MIN_VALUE;
        if (path.size() < 2) {return false;}
        for (int i = 0; i < path.size(); i++) {
            if (pre > path.get(i)) {
                return false;
            }
            pre = path.get(i);
        }
        return true;
    }

}

46.全排列

题目链接： . - 力扣（LeetCode）

class Solution {

    List<List<Integer>> result = new ArrayList<>();
    List<Integer> path = new ArrayList<>();
    
    public List<List<Integer>> permute(int[] nums) {
        boolean[] used = new boolean[nums.length];
        retrospective(nums, used);
        return result;
    }
    private void retrospective(int[] nums, boolean[] used) {
        if (path.size() == nums.length) {
            result.add(new ArrayList<>(path));
            return;
        }
        for (int i = 0; i < nums.length; i++) {
            if (used[i] != true) {
                path.add(nums[i]);
                used[i] = true;
                retrospective(nums, used);
                path.remove(path.size() - 1);
                used[i] = false;
            }
        }
        return;
    }

}

47.全排列 II

题目链接： . - 力扣（LeetCode）

class Solution {
    List<List<Integer>> result = new ArrayList<>();
    List<Integer> path = new ArrayList<>();
    Set<List<Integer>> set = new HashSet<>();
    public List<List<Integer>> permuteUnique(int[] nums) {
        boolean[] used = new boolean[nums.length];
        retrospective(nums, used);
        return result;
    }
    private void retrospective(int[] nums, boolean[] used) {
        if (path.size() == nums.length) {
            List<Integer> tmpList = new ArrayList<>(path);
            if (!set.contains(tmpList)) {
                set.add(tmpList);
                result.add(tmpList);
            }
            return;
        }
        for (int i = 0; i < nums.length; i++) {
            if (used[i] != true) {
                path.add(nums[i]);
                used[i] = true;
                retrospective(nums, used);
                path.remove(path.size() - 1);
                used[i] = false;
            }
        }
        return;
    }

}