JAVA经典之递归测试-----JAVA入门基础教程-Toy模板网

这篇具有很好参考价值的文章主要介绍了JAVA经典之递归测试-----JAVA入门基础教程。希望对大家有所帮助。如果存在错误或未考虑完全的地方，请大家不吝赐教，您也可以点击"举报违法"按钮提交疑问。

public class Test
{
    public static void main(String[] args)
    {
        Test a = new Test();
        System.out.println(a.getSum(100));
        System.out.println(a.getSum1(100));
        System.out.println(a.getMul(5));
        System.out.println(a.f(10));
    }
    public int getSum(int num)
    {
        int sum = 0;
        for (int i = 0; i <= num; i++)
        {
            sum = sum + i;
        }
        return sum;
    }
    public int getSum1(int num)
    {
        if(num == 1)
        {
            return 1;
        }
        else
        {
            return getSum1(num-1) + num;
        }
    }
    public int getMul(int n)
    {
        if(n == 1)
        {
            return 1;
        }
        else
        {
            return n * getMul(n -  1);
        }
    }
    public int f(int n)
    {
        if(n == 1)
        {
            return 1;
        }
        else if(n == 2)
        {
            return 1;
        }
        else
        {
            return f(n - 1) + f(n - 2);
        }
    }
}
public class Test
{
public static void main(String[] args)
{
Test a = new Test();
System.out.println(a.getSum(100));
System.out.println(a.getSum1(100));
System.out.println(a.getMul(5));
System.out.println(a.f(10));
}
public int getSum(int num)
{
int sum = 0;
for (int i = 0; i <= num; i++)
{
sum = sum + i;
}
return sum;
}
public int getSum1(int num)
{
if(num == 1)
{
return 1;
}
else
{
return getSum1(num-1) + num;
}
}
public int getMul(int n)
{
if(n == 1)
{
return 1;
}
else
{
return n * getMul(n - 1);
}
}
public int f(int n)
{
if(n == 1)
{
return 1;
}
else if(n == 2)
{
return 1;
}
else
{
return f(n - 1) + f(n - 2);
}
}
}文章来源地址https://www.toymoban.com/news/detail-416140.html