在C#中使用Intersect方法对自定义对象列表进行交集操作,需要重写自定义对象的Equals和GetHashCode方法,以确保比较两个对象是否相等的准确性。
假设有一个自定义对象Person,包含属性Id和Name,示例代码如下:
public class Person
{
public int Id { get; set; }
public string Name { get; set; }
public override bool Equals(object obj)
{
if (obj == null || GetType() != obj.GetType())
{
return false;
}
Person other = (Person)obj;
return Id == other.Id && Name == other.Name;
}
public override int GetHashCode()
{
return Id.GetHashCode() ^ Name.GetHashCode();
}
}
然后创建两个Person对象列表,使用Intersect方法找到它们的交集:
List<Person> list1 = new List<Person>
{
new Person { Id = 1, Name = "Alice" },
new Person { Id = 2, Name = "Bob" },
new Person { Id = 3, Name = "Charlie" }
};
List<Person> list2 = new List<Person>
{
new Person { Id = 2, Name = "Bob" },
new Person { Id = 3, Name = "Charlie" },
new Person { Id = 4, Name = "David" }
};
var intersectList = list1.Intersect(list2).ToList();
foreach (var person in intersectList)
{
Console.WriteLine(person.Id + " " + person.Name);
}
以上代码将输出:
2 Bob
3 Charlie
版权声明:本文内容由互联网用户自发贡献,该文观点仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容,请发送邮件至 55@qq.com 举报,一经查实,本站将立刻删除。转转请注明出处:https://www.szhjjp.com/n/970590.html