html目录树路径,转换目录路径JSON目录树表示

我终于开始为你制作样品了。这应该是一个很好的可扩展的递归解决方案。 :)

static void Main(string[] args)

{

Node root = new Node("/");

AddNode("New Text Document.txt", root);

AddNode("New folder/", root);

AddNode("New folder/README.txt", root);

Console.ReadKey();

}

public class Node

{

public Node() { Nodes = new List(); }

public Node(string fileName)

{

Nodes = new List();

Data = fileName;

}

public Node FindNode(string data)

{

if (this.Nodes == null || !this.Nodes.Any()) { return null; }

// check Node list to see if there are any that already exist

return this.Nodes

.FirstOrDefault(n => String.Equals(n.Data, data, StringComparison.CurrentCultureIgnoreCase));

}

public string Data { get; set; }

public List Nodes { get; set; }

}

public static Node AddNode(string filePath, Node rootNode)

{

// convenience method. this creates the queue that we need for recursion from the filepath for you

var tokens = filePath.Split('/').ToList();

// if you split a folder ending with/it leaves an empty string at the end and we want to remove that

if (String.IsNullOrWhiteSpace(tokens.Last())) { tokens.Remove(""); }

return AddNode(new Queue(tokens), rootNode);

}

private static Node AddNode(Queue tokens, Node rootNode)

{

// base case -> node wasnt found and tokens are gone :(

if (tokens == null || !tokens.Any())

{

return null;

}

// get current token, leaving only unsearched ones in the tokens object

string current = tokens.Dequeue();

// create node if not already exists

Node foundNode = rootNode.FindNode(current);

if (foundNode != null)

{

// node exists! recurse

return AddNode(tokens, foundNode);

}

else

{

// node doesnt exist! add it manually and recurse

Node newNode = new Node() { Data = current };

rootNode.Nodes.Add(newNode);

return AddNode(tokens, newNode);

}

}