#22 Generate Parentheses

最新推荐文章于 2019-06-20 19:49:08 发布

ice_camel

最新推荐文章于 2019-06-20 19:49:08 发布

阅读量587

点赞数

分类专栏： LeetCode 文章标签： LeetCode C String Recursion

本文链接：https://blog.csdn.net/ice_camel/article/details/46880195

版权

LeetCode 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

题目链接：https://leetcode.com/problems/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:

"((()))", "(()())", "(())()", "()(())", "()()()"

/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */

void generate(int n, char** ret, int *returnSize, char *tmpStr, int leftCount, int rightCount) {
	if (leftCount < n) { //左括号不到n个，可以放左括号
		tmpStr[leftCount + rightCount] = '(';
		generate(n, ret, returnSize, tmpStr, leftCount + 1, rightCount);
	}
	if (leftCount > rightCount && rightCount < n) {  //如果左括号多，可以放右括号
		tmpStr[leftCount + rightCount] = ')';
		generate(n, ret, returnSize, tmpStr, leftCount, rightCount + 1);
	}
	if (leftCount == n && rightCount == n) { //全部排序后保存输出
		tmpStr[leftCount + rightCount] = '\0';
		strcpy(ret[(*returnSize)++], tmpStr);
	}
}
char** generateParenthesis(int n, int* returnSize) {
	int i;
	int leftCount = 0, rightCount = 0;
    char tmpStr[20] = {};
	char **ret = (char **)malloc(sizeof(char *) * 10000);
	for (i = 0; i < 10000; ++i)
		ret[i] = (char *)malloc(sizeof(char));
	//递归地输出每一个可能的字符。需要满右括号大于等于左括号
	generate(n, ret, returnSize, tmpStr, leftCount, rightCount);
	return ret;
}