[4]括号生成

[4]括号生成

A.回溯法

a.图解

b.伪代码

fun(n)[]://n括号对数
  result=[]//存放结果集
  backtracking(n,result,0,0,"")//生成括号的函数
  return result
backtracking(n,result,left,right,str)
  if right>left://不合法
    return
  if left==right==n://合法且已生成所有
    result.add(str)//添加结果集
    return
  if left<n://添加左括号
    backtracking(n,result,left+1,right,str+"(")
   if right<left://添加右括号
    backtracking(n,result,left,right+1,str+"(")

c.源码

class Solution {
    // Leetcode 22. Generate Parentheses
    // Backtracking
    // Time Complexity: Hard To Say
    // Space Complexity: Hard To Say
    public List<String> generateParenthesis(int n) {
        List<String> result = new ArrayList<>();
        backtracking(n, result, 0, 0, "");
        return result;
    }

    private void backtracking(int n, List<String> result, int left, int right, String str) {
        if (right > left) {
            return;
        }
        if (left == n && right == n) {
            result.add(str);
            return;
        }

        if (left < n) {
            backtracking(n, result, left+1, right, str+"(");
        }

        if (right < left) {
            backtracking(n, result, left, right+1, str+")");
        }
    }
}