A. 哈希集 是独特元素的无序集合。它属于 系统收藏。通用的 名称空间。它用于我们希望防止在集合中插入重复项的情况。就性能而言,它比列表要好。对于两个哈希集的并集, 哈希集
null
语法:
firstSet.UnionWith(secondSet)
例外情况: 如果 设置 是 无效的 然后这个方法给出 无理例外 .
下面给出了一些例子,以更好地理解实施:
例1:
// C# code to find Union of two HashSet 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 for ( int i = 0; i < 5; i++) { mySet1.Add(i * 2); } // Inserting odd numbers less than // equal to 10 in HashSet mySet2 for ( int i = 0; i < 5; i++) { mySet1.Add(i * 2 + 1); } // Creating a new HashSet that contains // the union of both the HashSet mySet1 & mySet2 HashSet< int > ans = new HashSet< int >(mySet1); ans.UnionWith(mySet2); // Printing the union of both the HashSet foreach ( int i in ans) { Console.WriteLine(i); } } } |
输出:
0 2 4 6 8 1 3 5 7 9
例2:
// C# code to find Union of two HashSet 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( "GeeksforGeeks" ); mySet1.Add( "GeeksforGeeks" ); // Inserting elements in mySet2 mySet2.Add( "You" ); mySet2.Add( "are" ); mySet2.Add( "the" ); mySet2.Add( "best" ); // Creating a new HashSet that contains // the union of both the HashSet mySet1 & mySet2 HashSet< string > ans = new HashSet< string >(mySet1); ans.UnionWith(mySet2); // Printing the union of both the HashSet foreach ( string i in ans) { Console.WriteLine(i); } } } |
输出:
Hello GeeksforGeeks You are the best
参考:
© 版权声明
文章版权归作者所有,未经允许请勿转载。
THE END