﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>BlogJava-                                          爱情种子-文章分类-算法</title><link>http://www.blogjava.net/Crying/category/26231.html</link><description>                    如果敌人让你生气,那说明你没有胜他的把握</description><language>zh-cn</language><lastBuildDate>Thu, 27 Sep 2007 15:38:21 GMT</lastBuildDate><pubDate>Thu, 27 Sep 2007 15:38:21 GMT</pubDate><ttl>60</ttl><item><title>助教写的一个算法</title><link>http://www.blogjava.net/Crying/articles/148829.html</link><dc:creator>Crying</dc:creator><author>Crying</author><pubDate>Thu, 27 Sep 2007 10:58:00 GMT</pubDate><guid>http://www.blogjava.net/Crying/articles/148829.html</guid><wfw:comment>http://www.blogjava.net/Crying/comments/148829.html</wfw:comment><comments>http://www.blogjava.net/Crying/articles/148829.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/Crying/comments/commentRss/148829.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/Crying/services/trackbacks/148829.html</trackback:ping><description><![CDATA[<table>
    <tbody>
        <tr>
            <td>以前写的一个遍历算法，以后也应该用得着(89)</td>
        </tr>
        <tr>
            <td></td>
        </tr>
        <tr>
            <td align="left" div>
            <p>/*<br />
            &nbsp;&nbsp;&nbsp;&nbsp; * @author 於良伟<br />
            &nbsp;&nbsp;&nbsp;&nbsp; *&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 根先序遍历算法<br />
            &nbsp;&nbsp;&nbsp;&nbsp; * @param bizes&nbsp; 所选的遍历总数据<br />
            &nbsp;&nbsp;&nbsp;&nbsp; * @param bizID 当前遍历的根节点id<br />
            &nbsp;&nbsp;&nbsp;&nbsp; * @param treeList 遍历返回结果<br />
            &nbsp;&nbsp;&nbsp;&nbsp; * @return void<br />
            &nbsp;&nbsp;&nbsp;&nbsp; *<br />
            &nbsp;&nbsp;&nbsp;&nbsp; * */<br />
            &nbsp;&nbsp;&nbsp; private void traversal(List bizes,Long bizID, List treeList) {<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for (int i = 0; i &lt; bizes.size(); i++) {<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Business business = (Business) bizes.get(i);<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if (business.getParentBusiness()!=null &amp;&amp; bizID.equals(business.getParentBusiness().getId())) {<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; /*如果当前节点存在父节点并且当前节点的父节点编号与bizID相同,则添加到treeList*/<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; treeList.add(business);<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; /*遍历*/<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; traversal(bizes,business.getId(),treeList);<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }</p>
            <p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; } //for<br />
            &nbsp;&nbsp;&nbsp; }</p>
            <p>&nbsp;</p>
            <p>/*<br />
            &nbsp;&nbsp;&nbsp;&nbsp; * @author 於良伟<br />
            &nbsp;&nbsp;&nbsp;&nbsp; *&nbsp;&nbsp;&nbsp;&nbsp; 根据所选收支类型创建树<br />
            &nbsp;&nbsp;&nbsp;&nbsp; * @param&nbsp; biz&nbsp; 所选节点<br />
            &nbsp;&nbsp;&nbsp;&nbsp; * @param&nbsp; IOflag 收支类型<br />
            &nbsp;&nbsp;&nbsp;&nbsp; * @return&nbsp; List treeList<br />
            &nbsp;&nbsp;&nbsp;&nbsp; *<br />
            &nbsp;&nbsp;&nbsp;&nbsp; *<br />
            &nbsp;&nbsp;&nbsp;&nbsp; * */<br />
            &nbsp;&nbsp;&nbsp; public List builderTreeByBiz(final Business biz,final Integer IOflag){<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; /*从指定节点构造收支类型树结构的List*/<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; List treeList = new ArrayList();</p>
            <p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if (biz==null) {<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; /*如果biz为空,返回空List*/<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return treeList;<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }</p>
            <p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; /*添加biz到treeList*/<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; treeList.add(biz);<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; /*根先序遍历*/<br />
            &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; traversal(getBusinessByDepartment(biz.getDept(),IOflag),biz.getId(),treeList);</p>
            <p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return treeList;</p>
            <p>&nbsp;&nbsp;&nbsp; }</p>
            </td>
        </tr>
    </tbody>
</table>
<img src ="http://www.blogjava.net/Crying/aggbug/148829.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/Crying/" target="_blank">Crying</a> 2007-09-27 18:58 <a href="http://www.blogjava.net/Crying/articles/148829.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>