/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */

//回溯法
//http://www.cnblogs.com/zhanghaiba/p/3536534.html

//struct ListNode
//{
//    int val;
//    struct ListNode * next;
//};

//求出一個(gè)二叉樹(shù)中一共有多少個(gè)葉子節(jié)點(diǎn)纹磺，即路徑的數(shù)目
int getPaths(struct TreeNode * root)
{
    int left=0,right=0;
    if(root->left==NULL&&root->right==NULL)
    {
        return 1;
    }
    if(root->left!=NULL)
    {
        left=getPaths(root->left);
    }
    if(root->right!=NULL)
    {
        right=getPaths(root->right);
    }
    return left+right;
}

//將整型轉(zhuǎn)換為字符串斗忌，其中需要考慮到負(fù)數(shù)的情況聪蘸，此部分代碼有優(yōu)化空間
char * intToString(int num)
{
    int i=0,l=0;
    int temp=0;
    char * result;
    char * pre;//返回字符串前綴嘲恍，用來(lái)存儲(chǔ)符號(hào)
    int flag=0;
    
    if(num==0)
    {
        return "0";
    }
    
    if(num<0)
    {
        temp=abs(num);
        num=temp;
        pre=malloc(sizeof(char)*2);
        pre[0]='-';
        pre[1]='\0';
    }
    else
    {
        temp=num;
        pre=malloc(sizeof(char));
        pre[0]='\0';
    }
    
    while(temp!=0)
    {
        l++;
        temp=temp/10;
    }
    result=malloc(sizeof(char)*(l+1));
    result[l]='\0';
    
    for(i=l-1;i>=0;i--)
    {
        result[i]=(char)((num%10)+0x30);
        num=num/10;
    }
    
    strcat(pre,result);
    
    return pre;
}

//將鏈表轉(zhuǎn)換成字符串状您，中間用“->”連接
char * listNodeToString(struct ListNode * head)
{
    char * result=NULL;
    char * temp;
    int aa=0;
    result=malloc(sizeof(char));
    result[0]='\0';
    while(head!=NULL)
    {
        aa=head->val;
        temp=intToString(aa);
        strcat(result,temp);
        head=head->next;
        if(head!=NULL)
        {
            strcat(result,"->");
        }
    }
    return result;
}

int count=0;

void binaryTreePathOut(struct TreeNode * root,char ** result,struct ListNode * head,struct ListNode * location)
{
    location->val=root->val;
    location->next=NULL;
    if(root->left==NULL&&root->right==NULL)
    {
        //說(shuō)明到了葉子節(jié)點(diǎn)
        result[count]=malloc(sizeof(char));
        result[count][0]='\0';
        strcat(result[count],listNodeToString(head));
        count++;
        return;
    }
    location->next=malloc(sizeof(struct ListNode));
    location->next->next=NULL;
    if(root->left!=NULL)
    {
        binaryTreePathOut(root->left,result,head,location->next);
    }
    if(root->right!=NULL)
    {
        binaryTreePathOut(root->right,result,head,location->next);
    }
}

char** binaryTreePaths(struct TreeNode* root, int* returnSize) {
    

    struct ListNode * head;
    struct ListNode * location;
    char ** result;
    char * str;
    
    if(root==NULL)
    {
        return NULL;
    }
    
    //printf(intToString(-1234));
    //return NULL;
    count=0;
    
    *returnSize=getPaths(root);
    
    result=(char **)malloc(sizeof(char*)*(*returnSize));
    head=malloc(sizeof(struct ListNode));
    location=head;
    
    binaryTreePathOut(root,result,head,location);
    
    free(head);
    
    return result;
}