求n的階乘
public class Test
{
public static void main(String args[])
{
System.out.println(method(5));
}
public static long method(int n)
{
if(n == 1)
return 1;
else
retuen n * method(n-1) ;
}
}
求Fibona數列 滿足 F1 = 1,F2 = 2;Fn = Fn-1 + Fn-2 (n>2)
public class Test
{
public static void main(String args[])
{
System.out.println(method(5));
}
public static long method(int n)
{
if(n == 1 || n == 2)
return 1;
else
retuen method(n-1) + method(n-2) ;
}
}