zoukankan      html  css  js  c++  java
  • [LintCode] Generate Parentheses 生成括号

    Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

     
    Example

    Given n = 3, a solution set is:

    "((()))", "(()())", "(())()", "()(())", "()()()"

    LeetCode上的原题,请参见我之前的博客Generate Parentheses

    解法一:

    class Solution {
    public:
        /**
         * @param n n pairs
         * @return All combinations of well-formed parentheses
         */
        vector<string> generateParenthesis(int n) {
            if (n == 0) return {};
            vector<string> res;
            helper(n, n, "", res);
            return res;
        }
        void helper(int left, int right, string out, vector<string>& res) {
            if (left < 0 || right < 0 || left > right) return;
            if (left == 0 && right == 0) {
                res.push_back(out);
                return;
            }
            helper(left - 1, right, out + "(", res);
            helper(left, right - 1, out + ")", res);
        }
    };

    解法二:

    class Solution {
    public:
        /**
         * @param n n pairs
         * @return All combinations of well-formed parentheses
         */
        vector<string> generateParenthesis(int n) {
            set<string> res;
            if (n == 0) {
                res.insert("");
            } else {
                vector<string> pre = generateParenthesis(n - 1);
                for (auto a : pre) {
                    for (int i = 0; i < a.size(); ++i) {
                        if (a[i] == '(') {
                            a.insert(a.begin() + i + 1, '(');
                            a.insert(a.begin() + i + 2, ')');
                            res.insert(a);
                            a.erase(a.begin() + i + 1, a.begin() + i + 3);
                        }
                    }
                    res.insert("()" + a);
                }
            }
            return vector<string>(res.begin(), res.end());
        }
    };
  • 相关阅读:
    hdu 2485 Destroying the bus stations 迭代加深搜索
    hdu 2487 Ugly Windows 模拟
    hdu 2492 Ping pong 线段树
    hdu 1059 Dividing 多重背包
    hdu 3315 My Brute 费用流,费用最小且代价最小
    第四天 下载网络图片显示
    第三天 单元测试和数据库操作
    第二天 布局文件
    第一天 安卓简介
    Android 获取存储空间
  • 原文地址:https://www.cnblogs.com/grandyang/p/5683142.html
Copyright © 2011-2022 走看看