gpt4 book ai didi

list泛型自定义排序示例

转载 作者:qq735679552 更新时间:2022-09-29 22:32:09 26 4
gpt4 key购买 nike

CFSDN坚持开源创造价值,我们致力于搭建一个资源共享平台,让每一个IT人在这里找到属于你的精彩世界.

这篇CFSDN的博客文章list泛型自定义排序示例由作者收集整理,如果你对这篇文章有兴趣,记得点赞哟.

代码如下

static void Main(string[] args) {     Employee employee = new Employee();     //设置初始值     List<Employee> employeeList = new List<Employee>();     employeeList.Add(new Employee() { EmpId = "001", EmpName = "Tony" });     employeeList.Add(new Employee() { EmpId = "002", EmpName = "Mack" });     employeeList.Add(new Employee() { EmpId = "003", EmpName = "Jon" });     employeeList.Add(new Employee() { EmpId = "004", EmpName = "Dawei" });     employeeList.Add(new Employee() { EmpId = "005", EmpName = "Jack" });     employeeList.Add(new Employee() { EmpId = "006", EmpName = "Abby" });     employeeList.Add(new Employee() { EmpId = "007", EmpName = "Carrie" });     //指定置前排序元素     List<Employee> toSortList = new List<Employee>();     toSortList.Add(new Employee() { EmpId = "003", EmpName = "Jon" });     toSortList.Add(new Employee() { EmpId = "005", EmpName = "Jack" });     toSortList.Add(new Employee() { EmpId = "007", EmpName = "Carrie" });     //自定义 排序委托     employeeList.Sort((Employee x, Employee y) => (toSortList.Count(e => e.EmpId == y.EmpId) - toSortList.Count(e => e.EmpId == x.EmpId))); } public class Employee {     public string EmpId     {         get;         set;     }     public string EmpName     {         get;         set;     } } 。

  。

经过排序后将原本list中按001,002,003,排列的元素排序为003,005,007,001,002,004.。。。将指定的003,005,007,排列在List最前 。

最后此篇关于list泛型自定义排序示例的文章就讲到这里了,如果你想了解更多关于list泛型自定义排序示例的内容请搜索CFSDN的文章或继续浏览相关文章,希望大家以后支持我的博客! 。

26 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com