回溯算法

weixin_43826142

于 2021-03-25 21:04:21 发布

阅读量62

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法 java

本文链接：https://blog.csdn.net/weixin_43826142/article/details/115218614

版权

LeetCode 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

2021.3.25

78. 子集

在这里插入图片描述

    class Solution {
        List<List<Integer>> res = new LinkedList<>();

        public List<List<Integer>> subsets(int[] nums) {
            LinkedList<Integer> track = new LinkedList<>();
            backtrack(nums, 0, track);
            return res;
        }

        void backtrack(int[] nums, int start, LinkedList<Integer> track) {
            res.add(new LinkedList<>(track));
            for (int i = start; i < nums.length; i++) {
                track.add(nums[i]);
                backtrack(nums, i + 1, track);
                track.removeLast();
            }
        }
    }

77. 组合

在这里插入图片描述

class Solution {
        List<List<Integer>> res = new LinkedList<>();

        public List<List<Integer>> combine(int n, int k) {
            if (k <= 0 || n <= 0) {
                return res;
            }
            LinkedList<Integer> track = new LinkedList<>();
            backtrack(n, k, 1, track);
            return res;
        }

        void backtrack(int n, int k, int start, LinkedList<Integer> track) {
            if (k == track.size()) {
                res.add(new LinkedList<>(track));
                return;
            }
            for (int i = start; i <= n; i++) {
                track.addLast(i);
                backtrack(n, k, i + 1, track);
                track.removeLast();
            }
        }
    }

46. 全排列

在这里插入图片描述

class Solution {
    List<List<Integer>> res = new LinkedList<>();
    public List<List<Integer>> permute(int[] nums) {
        LinkedList<Integer> track = new LinkedList<>(); 
        backtrack(nums,track);
        return res;
    }

    void backtrack(int[] nums, LinkedList track){
        if(track.size() == nums.length){
            res.add(new LinkedList(track));
            return;
        }
        for(int i = 0; i< nums.length;i++){
            if(track.contains(nums[i])){
                continue;
            }
            track.add(nums[i]);
            backtrack(nums,track);
            track.removeLast();
        }
    }
}