LeetCode – Refresh – Generate Parentheses

Nothing fancy, just use recursive.

 1 class Solution {
 2 public:
 3     void getP(vector<string> &result, string current, int left, int right) {
 4         if (left == 0 && right == 0) {
 5             result.push_back(current);
 6             return;
 7         }
 8         if (left > 0) {
 9             getP(result, current + ‘(‘, left - 1, right + 1);
10         }
11         if (right > 0) {
12             getP(result, current + ‘)‘, left, right - 1);
13         }
14     }
15     vector<string> generateParenthesis(int n) {
16         vector<string> result;
17         getP(result, "", n, 0);
18         return result;
19     }
20 };

时间： 2025-01-04 05:02:24

LeetCode – Refresh – Generate Parentheses的相关文章

【leetcode】Generate Parentheses

题目: 给定整数n,返回n对匹配的小括号字符串数组. For example, given n = 3, a solution set is: "((()))", "(()())", "(())()", "()(())", "()()()" 分析: 这种问题的模式是:1)问题的解有多个 ,2)每个解都是由多个有效的 "步骤" 组成的,3)变更以有解的某个或某些"步骤"

Leetcode 暴力 Generate Parentheses

本文为senlie原创,转载请保留此地址:http://blog.csdn.net/zhengsenlie Generate Parentheses Total Accepted: 11470 Total Submissions: 37301 Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3

[LeetCode][JavaScript]Generate Parentheses

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: "((()))", "(()())", "(())()", "()(())", "

[LeetCode] 22. 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: "((()))", "(()())", "(())()", "()(())", "()()()" 给一个数字n,

leetCode 22.Generate Parentheses (生成括号) 解题思路和方法

【LeetCode】Generate Parentheses (2 solutions)

LeetCode 022 Generate Parentheses

题目描述: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: "((()))", "(()())", "(())()", "()(())",

LeetCode – Refresh – Generate Parentheses