HashSet 、 Dictionary 、List性能对比_todictionary 和hashset 性能对比-优快云博客

本文通过实验比较了C#中HashSet, Dictionary与List三种数据结构在添加和查找操作上的性能表现。通过对一百万条数据进行操作并使用Stopwatch计时器记录时间，详细展示了不同数据结构在处理大量数据时的时间效率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Diagnostics;

namespace UrlMatchSiteNameModule
{
    class Program
    {
        static void Main(string[] args)
        {
            const int COUNT = 1000000;
            HashSet<int> hashSetOfInts = new HashSet<int>();
            Stopwatch stopWatch = new Stopwatch();
            for (int i = 0; i < COUNT; i++)
            {
                hashSetOfInts.Add(i);
            }

            stopWatch.Start();
            for (int i = 0; i < COUNT; i++)
            {
                hashSetOfInts.Contains(i);
            }
            stopWatch.Stop();

            Console.WriteLine(stopWatch.Elapsed);

            stopWatch.Reset();
            Dictionary<string, string> domainMap = new Dictionary<string, string>();
            for (int i = 0; i < COUNT; i++)
            {
                domainMap.Add(i.ToString(), i.ToString());
            }
            stopWatch.Start();
            string value;
            for (int i = 0; i < COUNT; i++)
            {
                domainMap.TryGetValue(i.ToString(), out value);
            }
            stopWatch.Stop();

            Console.WriteLine(stopWatch.Elapsed);

            stopWatch.Reset();
            List<int> listOfInts = new List<int>();
            for (int i = 0; i < COUNT; i++)
            {
                listOfInts.Add(i);
            }

            stopWatch.Start();
            for (int i = 0; i < COUNT; i++)
            {
                listOfInts.Contains(i);
            }
            stopWatch.Stop();

            Console.WriteLine(stopWatch.Elapsed);

            Console.Read();
        }
    }
}