首页 > 其他 > 详细

Generate Parentheses

时间:2014-04-03 11:31:20      阅读:591      评论:0      收藏:0      [点我收藏+]

Generate Parentheses

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 class Solution {
  private ArrayList<String> array;
  private int count;
  private int number;
  public ArrayList<String> generateParenthesis(int n) {
    array = new ArrayList<String>();
    number = n;
    StringBuilder s = new StringBuilder();//"(";
    s.append(‘(‘);
    recurse(s, 1, 0);
    return array;
  }
  private void recurse(StringBuilder s, int leftTotal, int rightTotal){
    if(leftTotal == number){
      int total = 2*number;
      StringBuilder sb = new StringBuilder(total);
      for(int i = 0; i < s.length(); i++){
        sb.append(s.charAt(i));
      }
      while(sb.length() < total){
        sb.append(‘)‘);
      }
      count++;
      array.add(sb.toString());
      return;
    }
    if(leftTotal > rightTotal){
      recurse(s.append(‘)‘), leftTotal, rightTotal+1);
      s.deleteCharAt(s.length()-1);
    }
    recurse(s.append(‘(‘), leftTotal+1, rightTotal);
    s.deleteCharAt(s.length()-1);
  }

}

Generate Parentheses,布布扣,bubuko.com

Generate Parentheses

原文:http://www.cnblogs.com/boole/p/3641508.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!