leetcode 22. 括号生成

dfs

class Solution {
public:
    void dfs(string cur,int leftnum,int rightnum,int n,vector<string>& ans){
        if(leftnum>n||rightnum>n)return;
        if(leftnum<rightnum)return;
        if(cur.size()==2*n){
            if(leftnum==n&&rightnum==n){
                ans.push_back(cur);
                return;
            }
            else{
                return;
            }
        }

        dfs(cur+"(",leftnum+1,rightnum,n,ans);
        dfs(cur+")",leftnum,rightnum+1,n,ans);
    }
    vector<string> generateParenthesis(int n) {
        vector<string> ans;
        if(n==0)return ans;
        dfs("",0,0,n,ans);
        return ans;
    }
};

优美的dp

class Solution {
public:
    //最优美的dp
    vector<string> generateParenthesis(int n) {
        vector<vector<string>> dp(n+1);
        if(n==0) return {};
        dp[0].push_back("");
        for(int i=1;i<=n;i++){
            for(int j=0;j<i;j++){
                for(auto str_dpj:dp[j]){
                    for(auto str_dp_ij1:dp[i-j-1]){
                        string tmp="("+str_dpj+")"+str_dp_ij1;
                        dp[i].push_back(tmp);
                    }
                }
            }
        }
        return dp[n];
    }
};