码迷,mamicode.com
首页 > 其他好文 > 详细

Generate Parentheses

时间:2014-06-17 22:59:06      阅读:223      评论:0      收藏:0      [点我收藏+]

标签:leetcode   java   string   

题目

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

For example, given n = 3, a solution set is:

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

方法

使用递归的思想。
    public void getParen(int left, int right, String str, List<String> list) {
        if (left == 0 && right == 0) {
            list.add(str);
        } else if (left == right) {
            str += "(";
            getParen(left - 1, right, str, list);
        } else {
            if (left > 0) {
                String strLeft = str + "(";
                getParen(left - 1, right, strLeft, list);
            }
            if (right > 0) {
                String strRight = str + ")";
                getParen(left, right - 1, strRight, list);
            }
        }
        
    }
    public List<String> generateParenthesis(int n) {
        List<String> list = new ArrayList<String>();
        String str = "";
        getParen(n, n , str, list);
        return list;
    }


Generate Parentheses,布布扣,bubuko.com

Generate Parentheses

标签:leetcode   java   string   

原文地址:http://blog.csdn.net/u010378705/article/details/31394333

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!