悲哀日记，2004-12-12，记解将字符串解析成树

最新推荐文章于 2023-01-30 16:20:17 发布

原创最新推荐文章于 2023-01-30 16:20:17 发布 · 1.3k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#jbuilder #c #apache #include #crm #border

杂记专栏收录该内容

5 篇文章

订阅专栏

博客主要讲述在2004年12月12日10点至11点37分解决了将包含多个目录的数组解析成树状结构的问题，并给出了构建目录树的代码实现，通过函数CreateTree对目录数组进行处理。

北京时间：2004-12-12 大约10点至 2004-12-12 11：37 解决，如何将
$Dirs=Array("C:","C:/Apache","C:/Apache/Apache2","C:/Apache/Apache2/bin","C:/Apache/Apache2/bin/iconv",
"C:/Apache/Apache2/cgi-bin","C:/Apache/Apache2/conf","C:/Apache/Apache2/error","C:/Apache/Apache2/error/include",
"C:/Downloads","D:","D:/JBuilder9","D:/JBuilder9/bin","D:/JBuilder9/doc","D:/程序",
"D:/程序/CRM_Trade","D:/程序/语句生成器");

解析成树状结构：最终解成：

*	C:
*	*	Apache
*	*	*	Apache2
*	*	*	*	bin
*	*	*	*	*	iconv
*	*	*	*	cgi-bin
*	*	*	*	conf
*	*	*	*	error
*	*	*	*	*	include
*	*	Downloads
*	D:
*	*	JBuilder9
*	*	*	bin
*	*	*	doc
*	*	程序
*	*	*	CRM_Trade
*	*	*	语句生成器

该解析问题困挠时间，（2004-12-9 星期四至加2004-12-12 星期五）原因：一直以为是用递归解决.思路不清昕,急于求成的想做出FTP 信息游览项目。

源：
$Dirs=Array("C:","C:/Apache","C:/Apache/Apache2","C:/Apache/Apache2/bin","C:/Apache/Apache2/bin/iconv",
"C:/Apache/Apache2/cgi-bin","C:/Apache/Apache2/conf","C:/Apache/Apache2/error","C:/Apache/Apache2/error/include",
"C:/Downloads","D:","D:/JBuilder9","D:/JBuilder9/bin","D:/JBuilder9/doc","D:/程序",
"D:/程序/CRM_Trade","D:/程序/语句生成器");

//构建目录树
function CreateTree($directory){
   $parent="";
   $level=1;
   $i=0;
   $n=count($directory);
   $cc=0;$pre=0;

   echo "<table border=1>";

for($i=0;$i<$n;$i++) {
          $s=explode("/",$directory[$i]);
       // print_r($s);
          $cc=count($s);
          if ($cc>$pre){
          $level=$cc;
          }
          else {
          if ($cc<$pre){
            $level=$cc;
          }
          }
          echo "<tr>";
       for ($k=0;$k<($level);$k++){
            echo "<td>*</td>";
          }
          echo "<td>".$s[$level-1]."</td>";
          $pre=$cc;
          echo "</tr>";