问题描述:
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:
“((()))”, “(()())”, “(())()”, “()(())”, “()()()”
分析:生成全部可行的组合。DFS二叉树。虽然使用了栈的思想,但是并没有显式的使用栈
代码如下:用时228 ms
public class Solution {
private void dfs(ArrayList<String> result,int n,String tmp,int size){//result:存储结果;n:剩余的(个数;tmp存储的临时字符串;size:当前栈中的个数(隐式的栈,而且栈中全是'(')
int i;
if(n==0){
for(i = 0;i<size;i++)
tmp+=")";
result.add(tmp);
return;
}
dfs(result, n-1, tmp+"(", size+1);
if(size>0)
dfs(result, n, tmp+")", size-1);
}
public ArrayList<String> generateParenthesis(int n) {
ArrayList<String> result = new ArrayList<String>();
if(n<=0)
return result;
dfs(result, n-1, "(",1);
return result;
}
}