Crying — Thu, 27 Sep 2007 10:58:00 GMT

以前写的一个遍历算法，以后也应该用得着(89)

/*
     * @author ��D��?br />      *       根先序遍历算�?br />      * @param bizes 所选的遍历��L��?br />      * @param bizID 当前遍历的根节点id
     * @param treeList 遍历�q�回�l�果
     * @return void
     *
     * */
    private void traversal(List bizes,Long bizID, List treeList) {
             for (int i = 0; i < bizes.size(); i++) {
                 Business business = (Business) bizes.get(i);
                 if (business.getParentBusiness()!=null && bizID.equals(business.getParentBusiness().getId())) {
                     /*如果当前节点存在父节点�ƈ且当前节点的父节点编号与bizID相同,则添加到treeList*/
                     treeList.add(business);
                     /*遍历*/
                     traversal(bizes,business.getId(),treeList);
                 }

} //for
}

/*
     * @author ��D��?br />      *     �Ҏ(gu��)��所选收支类型创建树(w��i)
     * @param biz 所选节�?br />      * @param IOflag 收支�c�d��
     * @return List treeList
     *
     *
     * */
    public List builderTreeByBiz(final Business biz,final Integer IOflag){
        /*从指定节�Ҏ(gu��)��造收支类型树(w��i)�l�构的List*/
        List treeList = new ArrayList();

        if (biz==null) {
            /*如果biz为空,�q�回�I�List*/
            return treeList;
        }

        /*��d��biz到treeList*/
        treeList.add(biz);
        /*根先序遍�?/
        traversal(getBusinessByDepartment(biz.getDept(),IOflag),biz.getId(),treeList);

return treeList;

}

Crying 2007-09-27 18:58 发表评论

中文亚洲字幕,激情综合色丁香一区二区,在线观看av网站永久