C#|两个散列集的交集

A. 哈希集 是独特元素的无序集合。它是在 系统收藏。通用的 名称空间。它用于我们希望防止在集合中插入重复项的情况。就性能而言,它比列表要好。 哈希集 .与(IEnumerable)相交 )方法 用于修改当前 哈希集 对象只包含该对象和指定集合中存在的元素。

null

语法:

mySet1.IntersectWith(mySet2)

在这里 mySet1 mySet2 这是两个哈希集。

例外情况: 这种方法会给你 无理例外 如果HashSet是 无效的 .

下面给出了一些例子,以更好地理解实施:

例1:

// C# code to find Intersection
//of two HashSets
using System;
using System.Collections.Generic;
class GFG {
// Driver code
public static void Main()
{
// Creating a HashSet of integers
HashSet< int > mySet1 = new HashSet< int >();
// Creating a HashSet of integers
HashSet< int > mySet2 = new HashSet< int >();
// Inserting even numbers less than
// equal to 10 in HashSet mySet1
Console.WriteLine( "Elements in Set 1 :" );
for ( int i = 0; i < 5; i++) {
mySet1.Add(i * 2);
Console.WriteLine(i * 2);
}
// Inserting odd numbers less than
// equal to 10 in HashSet mySet2
Console.WriteLine( "Elements in Set 2 : " );
for ( int i = 0; i < 5; i++) {
mySet1.Add(i * 2 + 1);
Console.WriteLine(i *2 + 1);
}
// Creating a new HashSet that contains
// the Intersection of both the HashSet mySet1 & mySet2
HashSet< int > ans = new HashSet< int >(mySet1);
ans.IntersectWith(mySet2);
// Printing the Intersection of both the HashSets
// It should show no element in the output
// as there is no element common in both
// the HashSets
foreach ( int i in ans)
{
Console.WriteLine(i);
}
}
}


输出:

Elements in Set 1 :
0
2
4
6
8
Elements in Set 2 : 
1
3
5
7
9

例2:

// C# code to find Intersection
// of two HashSets
using System;
using System.Collections.Generic;
class GFG {
// Driver code
public static void Main()
{
// Creating a HashSet of strings
HashSet< string > mySet1 = new HashSet< string >();
// Creating a HashSet of strings
HashSet< string > mySet2 = new HashSet< string >();
// Inserting elements in mySet1
mySet1.Add( "Hello" );
mySet1.Add( "Geeks" );
mySet1.Add( "GeeksforGeeks" );
// Inserting elements in mySet2
mySet2.Add( "Geeks" );
mySet2.Add( "and" );
mySet2.Add( "GeeksforGeeks" );
mySet2.Add( "are" );
mySet2.Add( "the" );
mySet2.Add( "best" );
// Creating a new HashSet that contains
// the Intersection of both the HashSet mySet1 & mySet2
HashSet< string > ans = new HashSet< string >(mySet1);
ans.IntersectWith(mySet2);
// Printing the Intersection of both the HashSet
foreach ( string i in ans)
{
Console.WriteLine(i);
}
}
}


输出:

Geeks
GeeksforGeeks

参考:

© 版权声明
THE END
喜欢就支持一下吧
点赞14 分享