打印包含n个括号的所有合法的组合

Implement an algorithm to print all valid (e.g., properly opened and closed) combinations of n-pairs of parentheses.

打印包含n个括号的所有合法的组合

#include <iostream>
using namespace std;

const int n = 100;
char a[n * 2];

void print(int l, int r, int i) {
if(l < 0 || r < l){
return;
}
if (l==0 && r==0) {
for (int j = 0; j < n * 2; j++)
{
if(a[j]==')' || a[j]=='(')
cout << a[j] << " ";
else
break;
}
cout << endl;
} else {
if (l > 0) {
a[i] = '(';
print(l - 1, r, i + 1);
}
if (r > l) {
a[i] = ')';
print(l, r - 1, i + 1);
}
}
}

int main() {
int count;
cin >> count;
print(count, count, 0);
return 0;
}