zoukankan      html  css  js  c++  java
  • C# 实现字符串去重

    方法一 注:需要.net 3.5框架的支持

    string s = "101,102,103,104,105,101,102,103,104,105,106,107,101,108";
    s = string.Join(",", s.Split(',').Distinct().ToArray());

    方法二

    class Program
        {
            static void Main(string[] args)
            {
                string result="";
                string str = "101,102,103,104,105,101,102,103,104,105,106,107,101,108";
                ArrayList list = array(str);
                for (int i = 0; i < list.Count;i++)
                {
                    if (i == list.Count - 1)
                    {
                        result += list[i];
                    }
                    else
                    {
                        result += list[i] + ",";
                    }
                }
                Console.WriteLine(result);
    
                Console.ReadKey();
            }
    
            static ArrayList array(string str)
            {
                ArrayList aimArr = new ArrayList();
                ArrayList strArr = new ArrayList();
                string [] strs=str.Split(',');
                foreach (string s in strs)
                {
                    strArr.Add(s);
                }
                for (int i = 0; i < strs.Length; i++)
                {
                    if (!aimArr.Contains(strs[i]))
                    {
                        aimArr.Add(strs[i]);
                    }
                }
                return aimArr;
            }
        }
    
      //101,102,103,104,105,106,107,108

    方法三:使用正则

      string input = "101,102,103,104,105,101,102,103,104,105,106,107,101,108";
                input = Regex.Replace(input + ",", @"(?:([^,]+,))(?=.*?1)", "");
                Console.WriteLine(input.Substring(0,input.Length-1));
  • 相关阅读:
    二叉搜索树
    【树】List Leaves
    模板——dijkstra单源最短路
    余数求和——除法分块
    倍增——ST表
    线段树——内存池
    线段树——模板
    洛谷 P1498 南蛮图腾
    洛谷 P2199 最后的迷宫
    洛谷 P1495 中国剩余定理
  • 原文地址:https://www.cnblogs.com/yhyjy/p/3799857.html
Copyright © 2011-2022 走看看