C#递归加递归乘

using System;




namespace Test2
{
class Recursion
{
public  long mul (long n)
{
//第一种递归乘
if (n > 1) {
return n * mul (n - 1);
} else {
return 1;
}
// 第二种递归乘
// if (n == 1 || n == 0) {
// return 1;
// } else {
// return n * mul (n - 1);
// }


}




public int add (int n)
{

if (n > 1) {
return n + add (n - 1);
} else {
return 1;
}
}
}


class MainClass
{
public static void Main (string[] args)
{
Recursion r = new Recursion ();
//递归加
//1+2+3+4+......+99+100
Console.WriteLine (r.add (100));
//递归乘
Console.WriteLine (r.mul (18));


}


}
}

猜你喜欢

转载自blog.csdn.net/qq_39097425/article/details/78945908