递归#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
{
return (n==0)?1:n*Factorial(n-1);
}
}
}
答案4:
public class Recursion
{
public static ulong Factorial(ulong n)
{
checked
{
return n == 0 ? 1 : n * Factorial(n-1);
}
}
}
答案5:
public class Recursion
{
public static ulong Factorial(ulong n)
{
checked {
return</