2023-5-6 括号生成

最新推荐文章于 2024-11-07 18:59:45 发布

ClownMing

最新推荐文章于 2024-11-07 18:59:45 发布

阅读量54

点赞数 2

文章标签：深度优先算法

本文链接：https://blog.csdn.net/weixin_63522344/article/details/130535459

版权

括号生成

在这里插入图片描述

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

    // 递归算法
    public static void dfs(int n, StringBuilder path, List<String> res, int open, int close) {

        if (path.length() == 2 * n) {
            res.add(path.toString());

            return;
        }
        if (open < n) {
            dfs(n, path.append('('), res, open + 1, close);
            path.deleteCharAt(path.length() - 1);
        }
        if (close < open) {
            dfs(n, path.append(')'), res, open, close + 1);
            path.deleteCharAt(path.length() - 1);
        }
    }
}