有关递归

来源:互联网 发布:java求二叉树的节点数 编辑:程序博客网 时间:2024/05/17 06:55

每次写递归函数的时候总是不能很好的做完,记录一点东西供自己日后参考。

 

比如,OC里递归函数的基本形式是:-(void) TraverseDevice:(CFLDepartment*) pDepart parentNode:(TreeNode*)pParentNode

pDepart 这个是递归时所需要的数据,pParentNode是父节点的指针或对象,以下是一个简单例子:

 

-(NSInteger)LoadDevXml:(CFLOrganization*)pOrg

{

        CFLDepartment *pDepartment = pOrg->getDepartment(i);

        while(pOrg->isDepartmentEof() != FALSE && pDepartment != NULL)

        {

            myDevNodes[m_treeIndex] = [[TreeNodealloc]init];

            myDevNodes[m_treeIndex].title=[NSStringstringWithCString:pDepartment->_nameencoding:m_enc];

            myDevNodes[m_treeIndex].key=[NSStringstringWithFormat:@"%d",pDepartment->_id];

            [selfTraverseDevice:pDepartment parentNode:myDevNodes[m_treeIndex]];

            pDepartment = pOrg->getNextDepartment();

        }

    }

    return i;

}

 

-(void) TraverseDevice:(CFLDepartment*) pDepart parentNode:(TreeNode*)pParentNode

{

    int i = pDepart->firstDepartment();

    if(i != - 1)

    {

        CFLDepartment *pChildDepart = pDepart->getDepartment(i);

        while(pDepart->isDepartmentEof() != FALSE && pChildDepart != NULL)

        {

            [selfindexInc];

            myDevNodes[m_treeIndex] = [[TreeNodealloc]init];

            myDevNodes[m_treeIndex].title=[NSStringstringWithCString:pChildDepart->_nameencoding:m_enc];

            myDevNodes[m_treeIndex].key=[NSStringstringWithFormat:@"%d",pChildDepart->_id];           

            [pParentNodeaddChild:myDevNodes[m_treeIndex]];

            pParentNode.expanded =YES;

            [selfTraverseDevice:pChildDepart parentNode:myDevNodes[m_treeIndex]];

            pChildDepart = pDepart->getNextDepartment();

        }

    }

}