C#练习题答案: 递归＃1 - 阶乘【难度：1级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

递归#1 - 阶乘【难度:1级】:

答案1:

public class Recursion
{
    public static ulong Factorial(ulong n)
    {
        checked
        {
            return n == 0 ? 1 : n*Factorial(n - 1);
        }
    }
}​

答案2:

public class Recursion
{
  
  public static ulong Factorial(ulong n)
  {
    checked
    {
      return (n == 0) ? 1 : n * Factorial(n-1);
    }
  }
  
  
}​

答案3:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      // Write your in this checked area
      return (n==0)?1:n*Factorial(n-1);    
    }
  }
}​

答案4:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      // Write your in this checked area
      return n == 0 ? 1 : n * Factorial(n-1);
    }
  }
}​

答案5:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
      checked { return n == 0 ? 1 : n * (Factorial(n - 1)); }
  }
}​

答案6:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
        return n == 0 ? 1 : (n * Factorial(n - 1));   
    }
  }
}​

答案7:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      return (n == 0) ? 1 : (n * Factorial(n - 1));
    }
  }
}​

答案8:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      return (n < 2) ? 1 : n * Factorial(n - 1);    
    }
  }
}​

答案9:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      return n < 2 ? 1 : n * Factorial(n - 1);
    }
  }
}​

答案10:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      // Use recursion until n is 0
      return n == 0 ? 1 : n*Factorial(n-1);    
    }
  }
}​

答案11:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
       if (n > 1)
                return ((ulong)n) * Factorial(n - 1);
            else
                return 1;
     
    }
  }
}​

答案12:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      return n <= 1 ? 1 : n*Factorial(n-1);    
    }
  }
}​

答案13:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
          
    checked
    {
 
      return n<=1 ? 1 : n*(Factorial(n-1));
         
    }
  }
}​

答案14:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      return (n <= 1) ? 1 : n*Factorial(n-1);
    }
  }
}​

答案15:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      return ( n <= 1 ? 1 : n * Factorial( n - 1 ) );
    }
  }
}​

答案16:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      return n > 0 ? n * Factorial(n - 1) : 1;
    }
  }
}​

答案17:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      return (n > 0) ? n * Factorial(n - 1) : 1;    
    }
  }
}​

答案18:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      // Write your in this checked area
      return n > 0 ? n * Factorial(n - 1) : 1;    
    }
  }
}​

答案19:

public class Recursion
{
  public static ulong Factorial(ulong number)
  {
    checked
    {
      
      if (number == 0)
            {
                return 1;
            }
            return number * Factorial(number-1);
  }
      return 0;    
    }
  
}​

答案20:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      return n == 0UL ? 1UL : n * Factorial(n - 1);    
    }
  }
}​

答案21:

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      return n <= 0 ? 1 : n == 1 ? 1 : n * Factorial(n-1);   
    }
  }
}​

答案22:

using System;

public class Recursion
{
  public static ulong Factorial(ulong n)
  {
    checked
    {
      
      Console.WriteLine(n);
      if (n <= 1) return 1;
      else return n * Factorial(n-1);
      
    }
  }
}​

转载：https://blog.csdn.net/weixin_45444821/article/details/101825796