elr*_*anu 0 .net c# algorithm mongodb
我正在使用MongoDB,我需要编写一个算法来填充以下类,以构建树目录结构:
public class Dir
{
public string name { get; set; }
public string hash { get; set; }
public bool read { get; set; }
public bool write { get; set; }
public Dir[] dirs { get; set; }
}
Run Code Online (Sandbox Code Playgroud)
我将从形式MongoDB获得这样的文件夹的List字符串,distinct和sorted(空字符串是根):
Folder1
Folder2
Folder2/ChildFolder
Folder2/ChildFolder2
Folder2/ChildFolder3
Folder2/ChildFolder3/Folderrrr
Folder2/ChildFolder3/Hi
""
Run Code Online (Sandbox Code Playgroud)
我应该有一个Dir对象,它是根文件夹,在那个内部我应该有一个目录数组,在每个目录中我可以有另一个目录数组,所以一个...
任何的想法?谢谢你的帮助
适用于您的示例数据,但可能需要在将来进行一些更新
static void Main(string[] args)
{
var folders = new[] { "Folder1","Folder2","Folder2/ChildFolder","Folder2/ChildFolder2","Folder2/ChildFolder3",
"Folder2/ChildFolder3/Folderrrr", "Folder2/ChildFolder3/Hi"
};
var root = new Dir("Root");
foreach (var folder in folders)
{
BuildTree(folder, root);
}
}
private static void BuildTree(string path, Dir parent)
{
if (parent == null) return;
if (path.Contains("/"))
{
var dir = path.Substring(0, path.IndexOf("/"));
var newPath = path.Substring(dir.Length + 1);
Dir addNodeTo;
if (!parent.Contains(dir))
{
var newParent = new Dir(dir);
parent.Dirs.Add(newParent);
addNodeTo = newParent;
}
else
{
addNodeTo = parent.Get(dir);
}
BuildTree(newPath, addNodeTo);
}
else
{
if (!parent.Contains(path))
parent.Dirs.Add(new Dir(path));
}
}
public class Dir
{
public string Name { get; private set; }
public string Hash { get; set; }
public bool Read { get; set; }
public bool Write { get; set; }
public List<Dir> Dirs { get; private set; }
public Dir(string name)
{
Name = name;
Dirs = new List<Dir>();
}
public bool Contains(string name)
{
return Dirs.Any(d => d.Name.Equals(name));
}
public Dir Get(string name)
{
return Dirs.FirstOrDefault(d => d.Name.Equals(name));
}
public override string ToString()
{
return Name;
}
}
Run Code Online (Sandbox Code Playgroud)