C#练习题答案: 找到除数！【难度：1级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

最新推荐文章于 2024-10-10 22:59:02 发布

goodview andyldm

最新推荐文章于 2024-10-10 22:59:02 发布

阅读量126

点赞数

分类专栏： C#编程高级练习文章标签： csharp面试题库和答案 csharp编程练习算法数学逻辑

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

版权

C#编程高级练习专栏收录该内容

236 篇文章 2 订阅

订阅专栏

找到除数!【难度:1级】:

答案1:

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

public class Kata
{
  public static int[] Divisors(int n)
  {
    List<int> l = new List<int>();
    for (int i = 2; i <= Math.Sqrt(n); i++) if (n % i == 0) l.Add(i);
    if (l.Count == 0) return null;
    List<int> k = new List<int>(Enumerable.Reverse(l.ToArray().Select(x => n / x).ToArray().Where(x => !l.Contains(x))));
    l.AddRange(k);
    return l.ToArray();
  }
}

答案2:

using System.Linq;
using System;

public class Kata
{
  public static int[] Divisors(int n)
  {
   int[] divisors = Enumerable.Range(2, (int)Math.Sqrt(n)).Where(x => x < n &amp;&amp; n % x == 0).SelectMany(x => new[] { x, n / x }).GroupBy(x => x).Select(g => g.First()).OrderBy(x => x).ToArray();
            return divisors.Length != 0 ? divisors : null;
  }
}

答案3:

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

public class Kata
{
  public static int[] Divisors(int n)
        {
            List<int> divisors = new List<int>();
            int max = (int)Math.Sqrt(n);

            for (int i = 2; i <= max; i++)
            {
                if (n % i == 0)
                {
                    divisors.Add(i);
                    if (i != n / i)
                        divisors.Add(n / i);
                }
            }
            if(divisors.Count() == 0)
              return null;
            else
              return divisors.OrderBy(x => x).ToArray();
        }
}

答案4:

using System;
using System.Collections.Generic;

public class Kata
{
    private static List<int> _result = new List<int>();
    private static int _previousDivisor;
    private static int _sqrt;

    public static int[] Divisors(int n)
    {
        _previousDivisor = n;
        _sqrt = (int) Math.Sqrt(n);
        _result.Clear();
        for (int i = 2; i < _previousDivisor &amp;&amp; i <= _sqrt; i++)
        {
            if (n % i == 0)
            {
                _result.Add(i);
                _previousDivisor = n / i;
                if (i != _previousDivisor)
                {
                    _result.Add(_previousDivisor);
                }
            }
        }
        if (_result.Count > 0)
        {
            _result.Sort();
            return _result.ToArray();
        }
        else return null;

    }
}

答案5:

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

public class Kata
{
      public static int[] Divisors(int n)
      {
          const int lowerBound = 1;
          const int firstPrimeNumber = 2;

          if (IsOutsideTolerance(n, lowerBound)) return null;
          if (n == firstPrimeNumber) return null;

          var divisors = GetDivisors(n);

          if (IsPrimeNumber(divisors)) return null;

          divisors.Sort();

          return divisors.ToArray();
      }

      private static bool IsOutsideTolerance(int n, int lowerBound)
      {
          return n <= lowerBound;
      }

      private static bool IsPrimeNumber(List<int> divisors)
      {
          return !divisors.Any();
      }

      private static List<int> GetDivisors(int n)
      {
          var divisors = new List<int>();

          var squareRouteOfNumber = (int)Math.Sqrt(n);
          int inverse;

          for (int i = 2; i <= squareRouteOfNumber; ++i)
          {
              if (n % i == 0)
              {
                  divisors.Add(i);

                  inverse = n / i;

                  if (i != inverse)
                  {
                      divisors.Add(inverse);
                  }
              }
          }

          return divisors;
      }
  }

答案6:

using System;
using System.Collections.Generic;

public class Kata
{
    public static int[] Divisors(int n)
    {
        var divisors = new List<int>();
        int currentDivisor = 2;
        double root = Math.Sqrt(n);

        while (currentDivisor <= root)
        {
            if (n % currentDivisor == 0)
            {
                divisors.Add(currentDivisor);

                if (currentDivisor != root)
                    divisors.Add(n / currentDivisor);
            }

            currentDivisor++;
        }

        if (divisors.Count == 0)
            return null;

        divisors.Sort();
        return divisors.ToArray();
    }
}

答案7:

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

public class Kata
{
    public static int[] Divisors(int n)
    {
        var result = new List<int>();
        for (var i = 2; i <= Math.Sqrt(n); i++)
            if (n % i == 0)
                result.Add(i);

        if (result.Count == 0)
            return null;

        result.AddRange(result.Select(x => n / x).Where(x => !result.Contains(x)).Reverse());
        return result.ToArray();
    }
}

答案8:

using System;
using System.Linq;
using System.Collections.Generic;
public class Kata
{
  public static int[] Divisors(int n)
  {
  List<int> sample= new List<int>(){};
    for (int i = 2; i <= Math.Sqrt(n); i++)
    {
      if (n % i == 0)
      {
        sample.Add(i);
        sample.Add(n/i);
      }
    }  
    sample = sample.OrderBy(x=>x).ToList();
    return sample.Count() > 0 ? sample.Distinct().ToArray() : null;
  }
}

答案9:

using System.Collections.Generic;
using System;
using System.Linq;
public class Kata
{
  public static int[] Divisors(int n)
  {
    var listNumber = new List<int>();
    for (int i = 2; i <= Math.Sqrt(n); i++) if (n % i == 0) listNumber.Add(i);
    if (listNumber.Count == 0) return null;
    List<int> k = new List<int>(Enumerable.Reverse(listNumber.ToArray().Select(x => n / x).ToArray().Where(x => !listNumber.Contains(x))));
    listNumber.AddRange(k);
    return listNumber.ToArray();
  }
}

答案10:

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

public class Kata
{
  public static int[] Divisors(int n)
  {
    List<int> result = new List<int>();

    for (int i = 2; i <= n / i; i++)
    {
      if (n % i == 0)
      {
        result.Add(i);
        if (i != n / i)
        {
          result.Add(n / i);
        }
      }
    }

    result.Sort();
    return result.Count == 0 ? null : result.ToArray();
  }
}