当前位置：网站首页>Recursive search sequence set

Recursive search sequence set

2022-04-22 07:28:00 【yinhua405】

Give a positive integer n , Return all the data containing n The legal sequence of parentheses .

Such as to 3 , We have to return a sequence like this （ aggregate ）： ["((()))","(()())","(())()","()(())","()()()"] , And so on

set<string> generateParenthesis(int n)

{

if (n == 0)

return{ "" }; // Basic information

set<string> ans;

for (int i = 0; i < n; i++)

{

for (string left : generateParenthesis(i)) // choose s

{

for (string right : generateParenthesis(n - i - 1)) // choose t

{

ans.insert("(" + left + ")" + right); // structure

}

return ans;

}

版权声明
本文为[yinhua405]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/04/202204220613324938.html