递归遍历文件夹并收集最长路径代码,CSharp代码库,德仔网

代码语言

代码分类

【CSharp】递归遍历文件夹并收集最长路径

作者:梦想天空 / 发布于2011/1/18/ 842

<div><span style="color: #000000">ArrayListary</span><span style="color: #000000">=</span><span style="color: #000000"></span><span style="color: #0000ff">new</span><span style="color: #000000">ArrayList();

</span><span style="color: #008000">//</span><span style="color: #008000">筛选最长路径</span><span style="color: #008000">
</span><span style="color: #000000"></span><span style="color: #0000ff">protected</span><span style="color: #000000"></span><span style="color: #0000ff">void</span><span style="color: #000000">get_longest_path()
{
foldern</span><span style="color: #000000">=</span><span style="color: #000000">(folder)</span><span style="color: #0000ff">this</span><span style="color: #000000">;
search_folder_path((folder)n.parent_node,n.name);
</span><span style="color: #0000ff">for</span><span style="color: #000000">(</span><span style="color: #0000ff">int</span><span style="color: #000000">i</span><span style="color: #000000">=</span><span style="color: #000000"></span><span style="color: #800080">0</span><span style="color: #000000">;i</span><span style="color: #000000"><</span><span style="color: #000000">ary.Count</span><span style="color: #000000">-</span><span style="color: #000000"></span><span style="color: #800080">1</span><span style="color: #000000">;i</span><span style="color: #000000">++</span><span style="color: #000000">)
{
varfirst</span><span style="color: #000000">=</span><span style="color: #000000">ary[i].ToString();
varsecond</span><span style="color: #000000">=</span><span style="color: #000000">ary[i</span><span style="color: #000000">+</span><span style="color: #800080">1</span><span style="color: #000000">].ToString();
</span><span style="color: #0000ff">if</span><span style="color: #000000">(first.IndexOf(second)</span><span style="color: #000000">!=</span><span style="color: #000000"></span><span style="color: #000000">-</span><span style="color: #800080">1</span><span style="color: #000000">)
{
ary.Remove(second);
i</span><span style="color: #000000">--</span><span style="color: #000000">;
}
</span><span style="color: #0000ff">else</span><span style="color: #000000"></span><span style="color: #0000ff">if</span><span style="color: #000000">(second.IndexOf(first)</span><span style="color: #000000">!=</span><span style="color: #000000"></span><span style="color: #000000">-</span><span style="color: #800080">1</span><span style="color: #000000">)
{
ary.Remove(first);
i</span><span style="color: #000000">--</span><span style="color: #000000">;
}
}
}

</span><span style="color: #008000">//</span><span style="color: #008000">遍历文件目录</span><span style="color: #008000">
</span><span style="color: #000000"></span><span style="color: #0000ff">protected</span><span style="color: #000000"></span><span style="color: #0000ff">void</span><span style="color: #000000">search_folder_path(foldern,</span><span style="color: #0000ff">string</span><span style="color: #000000">path)
{
</span><span style="color: #0000ff">string</span><span style="color: #000000">new_path</span><span style="color: #000000">=</span><span style="color: #000000"></span><span style="color: #0000ff">string</span><span style="color: #000000">.Empty;
foldernew_node</span><span style="color: #000000">=</span><span style="color: #000000">n.find_path(path);
List</span><span style="color: #000000"><</span><span style="color: #000000">folder</span><span style="color: #000000">></span><span style="color: #000000">list</span><span style="color: #000000">=</span><span style="color: #000000"></span><span style="color: #0000ff">new</span><span style="color: #000000">List</span><span style="color: #000000"><</span><span style="color: #000000">folder</span><span style="color: #000000">></span><span style="color: #000000">();
new_node.load_child_folders(list);

</span><span style="color: #0000ff">if</span><span style="color: #000000">(list.Count</span><span style="color: #000000">></span><span style="color: #000000"></span><span style="color: #800080">0</span><span style="color: #000000">)
{
</span><span style="color: #0000ff">foreach</span><span style="color: #000000">(foldernd</span><span style="color: #0000ff">in</span><span style="color: #000000">list)
{
new_path</span><span style="color: #000000">=</span><span style="color: #000000">path</span><span style="color: #000000">+</span><span style="color: #000000"></span><span style="color: #800000">"</span><span style="color: #800000">/</span><span style="color: #800000">"</span><span style="color: #000000"></span><span style="color: #000000">+</span><span style="color: #000000">nd.name;
ary.Add(new_path);
search_folder_path(n,new_path);
}
}
}</span></div>

评论列表

本站所提供的代码，版权归原作者所有，若有侵犯作者版权，请与我们联系，我们将立即删除或修改。谢谢!
本站所有代码发布及提供者。

试试其它关键字

　遍历文件夹　

同语言下

可能有用的

梦想天空贡献的其它代码(1)

.递归遍历文件夹并收集最长路径