zoukankan      html  css  js  c++  java
  • List排序的两种简便方式

    using System;
    using System.Collections.Generic;
    using System.Linq;
    using System.Text;
    namespace ListSort
    {
        class Program
        {
            static void Main(string[] args)
            {
                List<Customer> listCustomer = new List<Customer>();
                listCustomer.Add(new Customer { name = "客户1", id = 0 });
                listCustomer.Add(new Customer { name = "客户2", id = 1 });
                listCustomer.Add(new Customer { name = "客户3", id = 5 });
                listCustomer.Add(new Customer { name = "客户4", id = 3 });
                listCustomer.Add(new Customer { name = "客户5", id = 4 });
                listCustomer.Add(new Customer { name = "客户6", id = 5 });
                ///升序
                List<Customer> listCustomer1 = listCustomer.OrderBy(s => s.id).ToList<Customer>();
                //降序
                List<Customer> listCustomer2 = listCustomer.OrderByDescending(s => s.id).ToList<Customer>();
                //Linq排序方式
                List<Customer> listCustomer3 = (from c in listCustomer
                                                orderby c.id descending //ascending
                                                select c).ToList<Customer>();
                Console.WriteLine("List.OrderBy方法升序排序");
                foreach (Customer customer in listCustomer1)
                {
                    Console.WriteLine(customer.name);
                }
                Console.WriteLine("List.OrderByDescending方法降序排序");
                foreach (Customer customer in listCustomer2)
                {
                    Console.WriteLine(customer.name);
                }
                Console.WriteLine("Linq方法降序排序");
                foreach (Customer customer in listCustomer3)
                {
                    Console.WriteLine(customer.name);
                }
                Console.ReadKey();
            }
        }
        class Customer
        {
            public int id { get; set; }
            public string name { get; set; }
        }
    }
  • 相关阅读:
    POJ3122贪心或者二分(分蛋糕)
    POJ2118基础矩阵快速幂
    POJ2118基础矩阵快速幂
    POJ1328贪心放雷达
    POJ1328贪心放雷达
    hdu4642博弈(矩阵)
    hdu4642博弈(矩阵)
    POJ1042 贪心钓鱼
    POJ3160强连通+spfa最长路(不错)
    POJ3114强连通+spfa
  • 原文地址:https://www.cnblogs.com/xiashenbin/p/3816572.html
Copyright © 2011-2022 走看看