代码随想录算法训练营day29 491.递增子序列 46.全排列 47.全排列||

最新推荐文章于 2024-06-15 23:36:03 发布

二木三金l

最新推荐文章于 2024-06-15 23:36:03 发布

阅读量52

点赞数

文章标签：算法 leetcode

本文链接：https://blog.csdn.net/m0_74100262/article/details/131557942

版权

题目链接491.递增子序列

class Solution {
    List<List<Integer>> res = new ArrayList<>();
    List<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() >= 2){
            res.add(new ArrayList<>(path));
        }
        HashSet<Integer> hs = new HashSet<>();
        for(int i = startIndex; i < nums.length; i++){
            if(!path.isEmpty() && path.get(path.size()-1) > nums[i] || hs.contains(nums[i])){
                continue;
            }
            hs.add(nums[i]);
            path.add(nums[i]);
            backTracking(nums, i+1);
            path.remove(path.size()-1);
        }
    }

}

题目链接46.全排列

class Solution {
    List<List<Integer>> res = new ArrayList<>();
    LinkedList<Integer> path = new LinkedList<>();
    public List<List<Integer>> permute(int[] nums) {
        if(nums.length == 0){
            return res;
        }
        backTracking(nums,path);
        return res;
    }
    public void backTracking(int[] nums, LinkedList<Integer> path){
        if(path.size() == nums.length){
            res.add(new ArrayList<>(path));
        }
        for(int i = 0; i < nums.length; i++){
            if(path.contains(nums[i])){
                continue;
            }
            path.add(nums[i]);
            backTracking(nums, path);
            path.removeLast();
        }
    }
}

题目链接47.全排列||

class Solution {
    List<List<Integer>> res = new ArrayList<>();
    List<Integer> path = new LinkedList<>();
    public List<List<Integer>> permuteUnique(int[] nums) {
        boolean[] used = new boolean[nums.length];
        Arrays.fill(used,false);
        Arrays.sort(nums);
        if(nums.length == 0){
            return res;
        }
        backTracking(nums, used);
        return res;
    }
    public void backTracking(int[] nums, boolean[] used){
        if(path.size() == nums.length){
            res.add(new ArrayList<>(path));
            return;
        }
        for(int i = 0; i < nums.length; i++){
            if(i > 0 && nums[i] == nums[i-1] && used[i-1] == false){
                continue;
            }
            if(used[i] == false){
                used[i] = true;
                path.add(nums[i]);
                backTracking(nums, used);
                path.remove(path.size()-1);
                used[i] = false;
            }
        }
    }
}