-
Notifications
You must be signed in to change notification settings - Fork 0
/
generate_parentheses.cpp
74 lines (68 loc) · 1.76 KB
/
generate_parentheses.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
/*
* =====================================================================================
*
* Filename: generate_parentheses.cpp
*
* Description: Generate Parentheses: Given n pairs of parentheses, write a function
* to generate all combinations of well-formed parentheses.
*
* Version: 1.0
* Created: 07/10/18 09:00:59
* Revision: none
* Compiler: gcc
*
* Author: Zhu Xianfeng (), [email protected]
* Organization:
*
* =====================================================================================
*/
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
class Solution
{
public:
std::vector<std::string> generateParenthesis(int n)
{
std::vector<std::string> pa_list;
generateParenthesis(n, 0, "", &pa_list);
return pa_list;
}
private:
void generateParenthesis(int num, int cnt, const std::string& pa_item, std::vector<std::string>* pa_list)
{
if (pa_item.size() == (2 * num))
{
pa_list->push_back(pa_item);
return;
}
if (cnt < num)
{
generateParenthesis(num, cnt + 1, pa_item + "(", pa_list);
if (2 * cnt > pa_item.size())
{
generateParenthesis(num, cnt, pa_item + ")", pa_list);
}
}
else
{
// cnt == num
generateParenthesis(num, cnt, pa_item + ")", pa_list);
}
}
};
int main(int argc, char* argv[])
{
int num = 3;
if (argc > 1)
{
num = atoi(argv[1]);
}
auto pa_list = Solution().generateParenthesis(num);
for (const auto& item: pa_list)
{
printf("%s\n", item.c_str());
}
return 0;
}