C#练习题答案: FAC递归（防虫 - 发现错误并进行修复）【难度：1级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

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

本文提供了一组C#递归算法练习题目，名为FAC递归，难度为一级。博客包含了从答案1到答案10的多种解题思路，旨在帮助读者发现并修复错误，提升C#编程能力。

摘要由CSDN通过智能技术生成

FAC递归(防虫 - 发现错误并进行修复)【难度:1级】:

答案1:

namespace Recursion
{
    public class Fac
    {
        public int FacCalculation(int n)
        {
            return n < 0 ? 0 : n == 0 ? 1 : n * FacCalculation(n - 1);
        }
    }
}

答案2:

namespace Recursion {
  using System;
  public class Fac
  {
      public int FacCalculation(int n)
    {
      if (n < 0) return 0;
      return n > 0 ? n * FacCalculation(n - 1) : 1;
    }
  }
}

答案3:

namespace Recursion 
{
  using System;
  public class Fac
  {
    public int FacCalculation(int num)
    {
       if (num==0) return 1;//easiest way LOL
       if (num<0) return 0;
     return num==1?1:num * (FacCalculation(num-1));
    }
  }
  }

答案4:

namespace Recursion {
  using System;
  public class Fac
  {
    public int FacCalculation(int startValue){
      return FacRecursion(startValue);
    }
    protected int FacRecursion(int value){
      if(value == 1 | value == 0) return 1;
      if(value < 0)
      {
        return 0;
      }
      return value * FacRecursion(value-1);
    }
  }
}

答案5:

namespace Recursion
{
  using System;
  
  public class Fac
  {
    public int FacCalculation(int startValue)
    {
      return FacRecursion(startValue);
    }
    protected int FacRecursion(int value)
    {
      return value == 0 ? 1 : value < 0 ? 0 : value * FacRecursion(value-1);
    }
  }
}

答案6:

namespace Recursion {
  using System;
  public class Fac
  {
    public  int FacCalculation(int startValue)
        {
          
            if (startValue < 0)
                return 0;
            if (startValue == 1 || startValue == 0)
                return 1;
            else
                return FacRecursion(startValue);
        }


        protected int FacRecursion( int value)
        {
            return (value == 0)?1:value * FacRecursion(value - 1);               
            
        }
  }
}

答案7:

namespace Recursion {
  using System;
  public class Fac
  {
    public int FacCalculation(int value){
      return FacRecursion(value);
    }
    protected int FacRecursion(int value){
      if(value < 0)
      {
        return 0;
        }
      if(value == 1 | value == 0){
        return 1;
      }
      return value*FacRecursion(value-1);
    }
  }
}

答案8:

namespace Recursion {
  using System;
  public class Fac
  {
    public int FacCalculation(int startValue){
      return FacRecursion(startValue);
    }
    protected int FacRecursion(int value){
      if(value < 0)
      {
        return 0;
      }
      else if(value == 1 || value == 0)
      {
        return 1;
      }
      return value*FacRecursion(value-1);
    }
  }
}

答案9:

namespace Recursion {
  using System;
  public class Fac
  {
    public int FacCalculation(int startValue){
      return FacRecursion(startValue);
    }
    protected int FacRecursion(int value){

      if(value == 1)
        return 1;
       if(value == 0)
        return 1;
       if(value < 0)
        return 0;
        
      return value * FacRecursion(value-1);
    }
  }
}

答案10:

namespace Recursion {
  using System;
  public class Fac
  {
    public int FacCalculation(int startValue){
      Console.WriteLine(startValue);
      return FacRecursion(startValue);
    }
    protected int FacRecursion(int value){
      if (value < 0)
        return 0;
      else if (value <= 1)
        return 1;
      else
        return value * FacRecursion(value - 1);
    }
  }
}