Question

假设我有以下字符串：

"PW_ARAY$2V_BA_A$VOT"
"PW_ARAY$2V_BA_B$VOT"
"PW_ARAY$C0VP_15$HZ"
"PW_ARAY$C0VP_15$IB"
"PW_ARAY$C0VP_15$IN"
"PW_ARAY$C0VP_15$IR"
"PW_ARAY$C0VP_15$IW"
"PW_ARAY$C0VP_15$MVA"
"PW_ARAY$C0VP_15$MW"
"PW_ARAY$C0VP_15$MX"
etc...

我想做一些非常通用/智能的东西，它可以基于提供的分隔符（例如：'_'和'$'）以树的形式重新排列我的字符串：

以下列表也应该给出相同的结果

"PW_ARAY$2V_BA_A$VOT"
"PW_ARAY$2V_BA_B$VOT"
"PW_ARAY$C0VP_15$HZ"
"PW_ARAY$C0VP_15$IB"
"PW_ARAY$C0VP_15$IN"
"PW_ARAY$C0VP_15$IR"
"C0VP_15$IW"
"C0VP_15$MVA"
"C0VP_15$MW"
"C0VP_15$MX"

任何想法都会受到赞赏。

由于

尼克

Answer 1

这是一个（工作）代码示例：

private class Node
{
    public string Value { get; private set; }
    public Node Parent { get; private set; }
    public List<Node> Children { get; private set; }
    public Node(string c, Node parent)
    {
        this.Value = c;
        this.Parent = parent;
        this.Children = new List<Node>();
    }
    public override string ToString()
    {
        return "Value: " + this.Value;
    }
}

private static Node BuildTree(IEnumerable<string> tokens, char[] sep)
{
    var root = new Node(null, null);
    foreach (var token in tokens)
    {

#if OLDVERSION
        var current = root;
        var splits = token.Split(sep);
#else
        var splits = token.Split(sep);
        var current = FindFirstNodeWithValue(root, splits.First());
        if (current == null)
            current = root;
        else
            current = current.Parent;
#endif

        for (int i = 0; i < splits.Length; i++)
        {
            string split = splits[i];
            var node = current.Children.FirstOrDefault(x => x.Value == split);
            if (node == null)
            {
                node = new Node(split, current);
                current.Children.Add(node);
            }
            current = node;
        }
    }
    return root;
}

private static Node FindFirstNodeWithValue(Node root, string val)
{
    if (root.Value == val)
        return root;
    foreach (var child in root.Children)
    {
        var res = FindFirstNodeWithValue(child, val);
        if (res != null)
            return res;
    }
    return null;
}

<强>用法：

static void Main(string[] args)
{
    string[] tokens = new[]
        {
            "PW_ARAY$2V_BA_A$VOT",
            "PW_ARAY$2V_BA_B$VOT",
            "PW_ARAY$C0VP_15$HZ",
            "PW_ARAY$C0VP_15$IB",
            "PW_ARAY$C0VP_15$IN",
            "PW_ARAY$C0VP_15$IR",
            "PW_ARAY$C0VP_15$IW",
            "PW_ARAY$C0VP_15$MVA",
            "PW_ARAY$C0VP_15$MW",
            "PW_ARAY$C0VP_15$MX",
        };

    var root = BuildTree(tokens, new[] { '_', '$' });
    // root has Value = null, but starting from the first child
    // of root you have exactly the same tree you draw in your question
}

基于一组字符串的公共部分构建树视图

1 个答案: