可以通过使用Intersect方法来判断Dictionary1的键是否包含于Dictionary2的键。下面是一个示例代码:

Dictionary<int, string> dictionary1 = new Dictionary<int, string>
{
    { 1, "One" },
    { 2, "Two" },
    { 3, "Three" }
};

Dictionary<int, string> dictionary2 = new Dictionary<int, string>
{
    { 2, "Two" },
    { 4, "Four" },
    { 5, "Five" }
};

bool containsKeys = dictionary1.Keys.Intersect(dictionary2.Keys).Any();

if (containsKeys)
{
    Console.WriteLine("Dictionary1 contains keys from Dictionary2");
}
else
{
    Console.WriteLine("Dictionary1 does not contain keys from Dictionary2");
}

在上述代码中,我们使用Intersect方法获取Dictionary1Dictionary2的键的交集,然后使用Any方法判断交集是否非空。如果交集非空,则说明Dictionary1的键包含于Dictionary2的键。

C#的Dictionary1的key是否包含Dictionary2的key

原文地址: https://www.cveoy.top/t/topic/jck5 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录