C#练习题答案: 排序数组矩阵由串长度【难度：1级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

最新推荐文章于 2024-10-06 22:44:39 发布

goodview andyldm

最新推荐文章于 2024-10-06 22:44:39 发布

阅读量132

点赞数

分类专栏： C#编程进阶练习文章标签： csharp面试题库和答案 csharp编程练习编程基础排序算法

本文链接：https://blog.csdn.net/weixin_45444821/article/details/100941518

版权

C#编程进阶练习专栏收录该内容

234 篇文章 10 订阅

订阅专栏

排序数组矩阵由串长度【难度:1级】:

答案1:

using System.Linq;

public class Kata
{
    public static string[] SortByLength (string[] array)
    {
        return array.OrderBy(e => e.Length).ToArray();
    }
}

答案2:

using System.Linq;
public class Kata
{
  public static string[] SortByLength (string[] array)
  {
    return array.OrderBy(x => x.Length).ToArray();
  }
}

答案3:

using System.Linq;
public class Kata
{
  public static string[] SortByLength (string[] array)
  {
    return array.OrderBy(x=>x.Length).ToArray();;
  }
}

答案4:

public class Kata
{
  public static string[] SortByLength (string[] array)
  {
            string secArr;
            bool isSorted = false;
            while (isSorted == false)
            {
                isSorted = true;
                for (int i = 0; i < array.Length - 1; i++)
                {
                    if (array[i].Length > array[i+1].Length)
                    {
                        secArr = array[i + 1];
                        array[i + 1] = array[i];
                        array[i] = secArr;
                        isSorted = false;
                    }
                    
                }
            }
    return array;
  }
}

答案5:

using System;

public class Kata
{
  public static string[] SortByLength (string[] array)
  {
    Array.Sort(array, (x,y) => x.Length.CompareTo(y.Length));
    return array;
  }
}

答案6:

using System;
using System.Linq;
public class Kata
{
  public static string[] SortByLength (string[] array) => array.OrderBy(x => x.Length).ToArray();
}

答案7:

using System.Linq;

public class Kata
{
  public static string[] SortByLength (string[] array)=> array.OrderBy(p => p.Length).ToArray();
  
}

答案8:

using System;
using System.Collections;

public class Kata
{
  public static string[] SortByLength (string[] array)
  {
    Array.Sort(array, new SmallestToLargestComparer());
    return array;
  }
}

public class SmallestToLargestComparer : IComparer  
{
   // Call CaseInsensitiveComparer.Compare with the parameters reversed.
   public int Compare(Object x, Object y)  
   {
      var X = (string)x;
      var Y = (string)y;
      return (X.Length > Y.Length) ? 1 : (X.Length < Y.Length) ? -1 : 0;
   }
}

答案9:

public class Kata
{

      
        public static string[] SortByLength(string[] array)
        {

            int lenArr = array.Length;

            for (int i = 0; i < lenArr; i++)
            {
                for (int j = 0; j < lenArr - 1; j++)
                {
                    if (array[j+1].Length < array[j ].Length)
                    {
                        string tmp = array[j];
                        array[j] = array[j + 1];
                        array[j + 1] = tmp;
                    }

                }
            }
                return array;
            
  }
}

答案10:

using System.Collections.Generic;
using System.Linq;
using System;

public class Kata
{
  public static string[] SortByLength (string[] array)
  {
    var result = new List<string>(array);
        
    return result.OrderBy(s => s.Length).ToArray();
  }
}

答案11:

using System.Linq;
using System;

public class Kata
{
  public static string[] SortByLength (string[] array)
  {
    array = array.OrderBy(x => x.Length).ToArray(); 
    return array;
  }
}