（再战leetcode）括号生成

最新推荐文章于 2024-11-13 11:37:20 发布

学逗b

最新推荐文章于 2024-11-13 11:37:20 发布

阅读量167

点赞数

文章标签： leetcode 深度优先算法

本文链接：https://blog.csdn.net/Leiyi_Ann/article/details/122386107

版权

22. 括号生成

题目描述

在这里插入图片描述

我的思路

先遍历所有情况(进行全遍历)，然后判断是否是括号，就添加进去。

代码

public class Test {
    public static void main(String[] args) {
        Solution solution = new Solution();
        System.out.println(solution.generateParenthesis(3));
    }
}

class Solution {
    public List<String> generateParenthesis(int n) {
        List<String> res = new ArrayList<>();
        if (n <= 0) {
            return res;
        }
        dfs(n, "", res);
        return res;
    }

    private void dfs(int n, String path, List<String> res) {
        if (path.length() == 2 * n) {
            if (isLegalBracket(path)) {
                res.add(path);
            }
            return;
        }
        dfs(n, path + "(", res);
        dfs(n, path + ")", res);
    }

    public boolean isLegalBracket(String s) {
        Deque<Character> stack = new LinkedList<>();
        int n = s.length();
        HashMap<Character, Character> map = new HashMap<Character, Character>() {
            {
                put(')', '(');
                put('}', '{');
                put(']', '[');
            }
        };
        for (int i = 0; i < n; i++) {
            char ch = s.charAt(i);
            if (map.containsKey(ch)) {
                if (stack.isEmpty() || !Objects.equals(stack.peek(), map.get(ch))) {
                    return false;
                }
                stack.pop();
            } else {
                stack.push(ch);
            }
        }
        return stack.isEmpty();
    }
}

思路二

同样是先全遍历，然后再剪枝。
剪枝条件

open < 2 || close <2
close > open

代码：

public class Test {
    public static void main(String[] args) {
//        Solution solution = new Solution();
//        System.out.println(solution.generateParenthesis(3));
        Solution02 solution02 = new Solution02();
        System.out.println(solution02.generateParenthesis(3));
    }
}

class Solution02 {
    public List<String> generateParenthesis(int n) {
        List<String> res = new ArrayList<>();
        dfs(n, "", res, 0, 0);
        return res;
    }

    private void dfs(int n, String path, List<String> res, int open, int close) {
        if (open > n || close > open) {
            return;
        }
        if (path.length() == 2 * n) {
            res.add(path);
            return;
        }
        dfs(n, path + "(", res, open + 1, close);
        dfs(n, path + ")", res, open, close + 1);
    }
}