C# 小算法1

 

 

 

 

 

            //判断 第一条的 ‘叶子2’ 在 第二条 数据中的 索引
            //任河特大桥,右幅,叶子2,桩基混凝土,
            //任河特大桥,,,,,右幅,,,叶子2,桥墩,
            
            string str1 = "任河特大桥,右幅,叶子2,桩基混凝土,";
            string str2 = "任河特大桥,,,,,右幅,,,叶子2,桥墩,";
            
            str1 = str1.Trim(',');
            str2 = str2.Trim(',');

            var arr1 = str1.Split(',');
            var arr2 = str2.Split(',');
            
            string NodeName_Source = "任河特大桥,右幅,叶子2";
            string NodeName_NotContainsEmpty = "";//拼出来的节点名 不含 空格节点
            string NodeName_ContainsEmpty = "";//拼出来的节点名 含   空格节点

            for (int i = 0; i < arr2.Length; i++)
            {
                string name = arr2[i];
                NodeName_ContainsEmpty += name + ",";

                if (string.IsNullOrWhiteSpace(name))
                {
                    continue;
                }
                NodeName_NotContainsEmpty += name + ",";
                
                //找到
                if (NodeName_NotContainsEmpty.Trim(',') == NodeName_Source)
                {
                    Console.WriteLine("find node array index: " + i);
                    Console.WriteLine(NodeName_NotContainsEmpty);
                    Console.WriteLine(NodeName_ContainsEmpty);

                    Console.Read();
                    return;
                }
            }


            Console.Read();
            return;

 

转载于:https://www.cnblogs.com/guxingy/p/10735650.html