NO.113 路径总和II

给定一个二叉树和一个目标和，找到所有从根节点到叶子节点路径总和等于给定目标和的路径。

说明: 叶子节点是指没有子节点的节点。

示例:
给定如下二叉树，以及目标和 sum = 22，

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \    / \
        7    2  5   1

返回:

[
   [5,4,11,2],
   [5,8,4,5]
]

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */


/**
 * Return an array of arrays of size *returnSize.
 * The sizes of the arrays are returned as *returnColumnSizes array.
 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
 */
void DFS(struct TreeNode* root,int sum,int *returnSize,int** returnColumnSizes,int depth,int *save,int***ret)
{
    if(!root)return;
    sum=sum-root->val;
    if(!root->left&&!root->right)
    {
        if(sum==0)
        {
            save=(int *)realloc(save,sizeof(int)*depth);
            save[depth-1]=root->val;
            (*returnSize)++;
            *returnColumnSizes=(int *)realloc(*returnColumnSizes,sizeof(int)*(*returnSize));
            (*returnColumnSizes)[(*returnSize)-1]=depth;
            *ret=(int **)realloc(*ret,sizeof(int *)*(*returnSize));
            (*ret)[(*returnSize)-1]=save;
        }
        else
        {
            free(save);
        }
    }
    else
    {
        int *tmp;
        if(root->left)
        {
            tmp=(int *)malloc(sizeof(int)*depth);
            if(save)memcpy(tmp,save,sizeof(int)*(depth-1));
            tmp[depth-1]=root->val;
            DFS(root->left,sum,returnSize,returnColumnSizes,1+depth,tmp,ret);
        }
        if(root->right)
        {
            tmp=(int *)malloc(sizeof(int)*depth);
            if(save)memcpy(tmp,save,sizeof(int)*(depth-1));
            tmp[depth-1]=root->val;
            DFS(root->right,sum,returnSize,returnColumnSizes,1+depth,tmp,ret);
        }
        free(save);
    }
}

int** pathSum(struct TreeNode* root, int sum, int* returnSize, int** returnColumnSizes){
    * returnSize=0;
    * returnColumnSizes=NULL;
    int **ret=NULL;
    DFS(root,sum,returnSize,returnColumnSizes,1,NULL,&ret);
    return ret;
}

执行用时 :16 ms, 在所有C提交中击败了84.21% 的用户

内存消耗 :23.4 MB, 在所有C提交中击败了20.00%的用户