22. Generate Parentheses

    /*
     * 22. Generate Parentheses 
     * 2015.12.13 by Mingyang
     * 1.长度标准:无
     * 2.可选的范围:只有左括号和右括号,先一直加左边,完了再加右边
     * 3.往前走一步:sb加了,left或right减一
     * 4.后退一步:sb remove
     * 5.特别的case:left和right都为0
     * 6.关于重复:无
     */
     public List<String> generateParenthesis(int n) {
            List<String> res=new ArrayList<String>();
            StringBuffer sb=new StringBuffer();
            dfs(res,sb,n,n);
            return res;
        }
        public void dfs(List<String> res,StringBuffer sb,int left,int right){
            if(left==0&&right==0){
                res.add(sb.toString());
                return;
            }
            if(left>right||left<0||right<0)
              return;
            sb.append('(');
            dfs(res,sb,left-1,right);
            sb.deleteCharAt(sb.length()-1);
            sb.append(')');
            dfs(res,sb,left,right-1);
            sb.deleteCharAt(sb.length()-1);
        }

 

转载于:https://www.cnblogs.com/zmyvszk/p/5399979.html

#include <cassert> /// for assert #include <iostream> /// for I/O operation #include <vector> /// for vector container /** @brief Backtracking algorithms @namespace backtracking / namespace backtracking { /* @brief generate_parentheses class */ class generate_parentheses { private: std::vectorstd::string res; ///< Contains all possible valid patterns void makeStrings(std::string str, int n, int closed, int open); public: std::vectorstd::string generate(int n); }; /** @brief function that adds parenthesis to the string. @param str string build during backtracking @param n number of pairs of parentheses @param closed number of closed parentheses @param open number of open parentheses */ void generate_parentheses::makeStrings(std::string str, int n, int closed, int open) { if (closed > open) // We can never have more closed than open return; if ((str.length() == 2 * n) && (closed != open)) { // closed and open must be the same return; } if (str.length() == 2 * n) { res.push_back(str); return; } makeStrings(str + ')', n, closed + 1, open); makeStrings(str + '(', n, closed, open + 1); } /** @brief wrapper interface @param n number of pairs of parentheses @return all well-formed pattern of parentheses */ std::vectorstd::string generate_parentheses::generate(int n) { backtracking::generate_parentheses::res.clear(); std::string str = “(”; generate_parentheses::makeStrings(str, n, 0, 1); return res; } } // namespace backtracking /** @brief Self-test implementations @returns void */ static void test() { int n = 0; std::vectorstd::string patterns; backtracking::generate_parentheses p; n = 1; patterns = {{“()”}}; assert(p.generate(n) == patterns); n = 3; patterns = {{“()()()”}, {“()(())”}, {“(())()”}, {“(()())”}, {“((()))”}}; assert(p.generate(n) == patterns); n = 4; patterns = {{“()()()()”}, {“()()(())”}, {“()(())()”}, {“()(()())”}, {“()((()))”}, {“(())()()”}, {“(())(())”}, {“(()())()”}, {“(()()())”}, {“(()(()))”}, {“((()))()”}, {“((())())”}, {“((()()))”}, {“(((())))”}}; assert(p.generate(n) == patterns); std::cout << “All tests passed\n”; } /** @brief Main function @returns 0 on exit */ int main() { test(); // run self-test implementations return 0; } 在这段代码的基础上为C++初学者出几个练习题?
03-08
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值