zoukankan      html  css  js  c++  java
  • 从指定节点的子孙节点中查找Text为nodeText的节点

         /// <summary>
            /// 从指定节点的子孙节点中查找Text为nodeText的节点
            /// </summary>
            /// <param name="nodeText">要查找的节点的Text值</param>
            /// <param name="kNode">查询kNode的所有子孙节点</param>
            /// <returns></returns>
            private TreeNode FindNode(string nodeText,TreeNode kNode) 
            {
                    foreach (TreeNode node in kNode.Nodes)
                    {
                        if (node.Text == nodeText)
                        {
                            return node;
                        }
                        else
                            if (node.Nodes.Count > 0)
                                return FindNode(nodeText, node);
                            else
                                continue;
                    }
                    return null;
            }
  • 相关阅读:
    BZOJ3669
    HDU3726
    BZOJ3282
    BZOJ2843
    Link/cut Tree
    Codeforces396A
    LOJ6277~6285 数列分块入门
    Codeforces446C
    Codeforces475D
    Codeforces103D
  • 原文地址:https://www.cnblogs.com/refresh/p/2494661.html
Copyright © 2011-2022 走看看