22. Generate Parentheses (backTracking)

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().
 */
char** generateParenthesis(int n, int* returnSize) {
    char** returnArray = NULL;
    if(n==) return returnArray;

    char* elem = malloc(sizeof(char)*(n*+));
    returnArray = malloc(sizeof(char*)*);

    backTracking(n,,elem, , returnArray, returnSize);
    return returnArray;
}

/*
 *@parameter
 *left(in): number of left parenthesis to add
 *right(in): number of right parenthesis to add
*/
void backTracking(int left, int right, char* elem, int pElem, char** returnArray, int* returnSize ){
    int i, j, pTmp;
    //逐一填(,然后逐一填)，每次都要回溯
    for(i = ; i < left; i++){ //fill (
        elem[pElem] = '(';
        pElem++;
        pTmp = pElem;
        for(j = ; j <= i+right; j++){ //fill )
            elem[pTmp] = ')';
            pTmp++;
            backTracking(left-i,i+right-j,elem, pTmp, returnArray, returnSize);
        }
    }

    //最后，是只填了(的情况，那么一次性填写所有的)
    elem[pElem] = '(';
    pElem++;
    for(i = ; i <= right+left; i++){
        elem[pElem] = ')';
        pElem++;
    }
    elem[pElem] = '\0';
    char* returnElem = malloc(sizeof(char) * (pElem+));
    memcpy(returnElem, elem, sizeof(char) * (pElem+));
    returnArray[*returnSize] = returnElem;
    (*returnSize)++;
}